On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Authors:
- 17 April 2023
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 63 (3) , 591-609
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- China Postdoctoral Science Foundation (2022M711926, 2022T150386)
- National Natural Science Foundation of China (12201352)
- Natural Science Foundation of Shandong Province (ZR2022QA083)
- Simons Foundation (630884)
This publication has 45 references indexed in Scilit:
- On extremal hypergraphs for Hamiltonian cyclesEuropean Journal of Combinatorics, 2012
- On Pósa's Conjecture for Random GraphsSIAM Journal on Discrete Mathematics, 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
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976