Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- 30 July 2019
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 55 (4) , 795-807
Abstract
For k ≥ 2 and r ≥ 1 such that k + r ≥ 4, we prove that, for any α > 0, there exists ε > 0 such that the union of an n‐vertex k‐graph with minimum codegree and a binomial random k‐graph with on the same vertex set contains the rth 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
Funding Information
- FAPESP (2014/18641-5, 2013/03447-6, 2018/04876-1)
- CNPq (310974/2013-5, 311412/2018-1, 423833/2018-9, 304733/2017-2, 428385/2018-4)
This publication has 33 references indexed in Scilit:
- On extremal hypergraphs for Hamiltonian cyclesEuropean Journal of Combinatorics, 2012
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphsAdvances in Mathematics, 2011
- Loose Hamilton cycles in hypergraphsDiscrete Mathematics, 2011
- Hamilton ℓ-cycles in uniform hypergraphsJournal of Combinatorial Theory, Series A, 2010
- Dirac-type results for loose Hamilton cycles in uniform hypergraphsJournal of Combinatorial Theory, Series B, 2010
- An approximate Dirac-type theorem for k-uniform hypergraphsCombinatorica, 2008
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degreeJournal of Combinatorial Theory, Series B, 2006
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- On the P sa-Seymour conjectureJournal of Graph Theory, 1998
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976