Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs

Andrew McDowell, Richard Mycroft

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)
62 Downloads (Pure)


We prove that for integers $2 \leq \ell < k$ and a small constant $c$, if a $k$-uniform hypergraph with linear minimum codegree is randomly `perturbed' by changing non-edges to edges independently at random with probability $p \geq O(n^{-(k-\ell)-c})$, then with high probability the resulting $k$-uniform hypergraph contains a Hamilton $\ell$-cycle. This complements a recent analogous result for Hamilton $1$-cycles due to Krivelevich, Kwan and Sudakov, and a comparable theorem in the graph case due to Bohman, Frieze and Martin.
Original languageEnglish
Article numberP4.36
Number of pages30
JournalElectronic Journal of Combinatorics
Issue number4
Publication statusPublished - 16 Nov 2018


  • Hamilton cycles
  • Random Hypergraphs
  • Perturbing


Dive into the research topics of 'Hamilton ℓ-Cycles in Randomly Perturbed Hypergraphs'. Together they form a unique fingerprint.

Cite this