Hamiltonicity in randomly perturbed hypergraphs
Authors:
- Jie HanJHJie Han
- Yi ZhaoYZYi Zhao
- 1 September 2020
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 144, 14-31
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Fundação de Amparo à Pesquisa do Estado de São Paulo (2014/18641-5)
- Simons Foundation (630884)
- National Science Foundation (DMS 1700622)
This publication has 26 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
- A Dirac-Type Theorem for 3-Uniform HypergraphsCombinatorics, Probability and Computing, 2006
- How many random edges make a dense graph hamiltonian?Random Structures & Algorithms, 2002
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976