Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Authors:
- Wiebke BedenknechtWBWiebke Bedenknecht
- Jie HanJHJie Han
- Yoshiharu KohayakawaYKYoshiharu Kohayakawa
- Guilherme Oliveira MotaGMGuilherme Oliveira Mota
Preprint
Abstract
For $k\ge 2$ and $r\ge 1$ such that $k+r\ge 4$, we prove that, for any $\alpha>0$, there exists $\epsilon>0$ such that the union of an $n$-vertex $k$-graph with minimum codegree $\left(1-\binom{k+r-2}{k-1}^{-1}+\alpha\right)n$ and a binomial random $k$-graph $\mathbb{G}^{(k)}(n,p)$ with $p\ge n^{-\binom{k+r-2}{k-1}^{-1}-\epsilon}$ on the same vertex set contains the $r^{\text{th}}$ power of a tight Hamilton cycle with high probability. This result for $r=1$ was first proved by McDowell and Mycroft.
Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphsRandom Structures & Algorithms, 2018
- Spanning structures and universality in sparse hypergraphsRandom Structures & Algorithms, 2016
- Tight Hamilton cycles in random uniform hypergraphsRandom Structures & Algorithms, 2012
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphsAdvances in Mathematics, 2011
- Perfect Matchings and K 4 3 -Tilings in Hypergraphs of Large CodegreeGraphs and Combinatorics, 2008
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- On the P sa-Seymour conjectureJournal of Graph Theory, 1998
- Proof of the Seymour conjecture for large graphsAnnals of Combinatorics, 1998
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976