Projects per year
Abstract
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 nonedges 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 language  English 

Article number  P4.36 
Number of pages  30 
Journal  Electronic Journal of Combinatorics 
Volume  25 
Issue number  4 
Publication status  Published  16 Nov 2018 
Keywords
 Hamilton cycles
 Random Hypergraphs
 Perturbing
Fingerprint
Dive into the research topics of 'Hamilton ℓCycles in Randomly Perturbed Hypergraphs'. Together they form a unique fingerprint.Projects
 1 Finished

Embeddings in hypergraphs
Engineering & Physical Science Research Council
30/03/15 → 29/03/17
Project: Research Councils