Random-graph square Hamilton-cycle conjecture
Let be the binomial random graph. The square of a Hamilton cycle is obtained from a Hamilton cycle by adding edges between all vertices at distance at most two on the cycle. Random-graph square Hamilton-cycle conjecture. If , then asymptotically almost surely contains the square of a Hamilton cycle.
References
Status
- Solved: Jeff Kahn, Bhargav Narayanan, and Jinyoung Park. The threshold for the square of a Hamilton cycle (Proceedings of the American Mathematical Society, 2020) https://doi.org/10.1090/proc/15419
Source: Daniela Kühn and Deryk Osthus, “Hamilton cycles in graphs and hypergraphs: an extremal perspective”, arXiv:1402.4268 (2014).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.