A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Resilience for tight Hamiltonicity
[article]
2021
arXiv
pre-print
We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any γ>0 and k≥3, we show that asymptotically almost surely, every subgraph of the binomial random k-uniform hypergraph G^(k)(n,n^γ-1) in which all (k-1)-sets are contained in at least (12+2γ)pn edges has a tight Hamilton cycle. This is a cyclic ordering of the n vertices such that each consecutive k vertices forms an edge.
arXiv:2105.04513v1
fatcat:y3gyj67jknc4tkkxsxlv3ltkfy