arXiv Analytics

Sign in

arXiv:2010.08592 [math.CO]AbstractReferencesReviewsResources

The threshold for the square of a Hamilton cycle

Jeff Kahn, Bhargav Narayanan, Jinyoung Park

Published 2020-10-16Version 1

Resolving a conjecture of K\"uhn and Osthus from 2012, we show that $p= 1/\sqrt{n}$ is the threshold for the random graph $G_{n,p}$ to contain the square of a Hamilton cycle.

Comments: 6 pages
Categories: math.CO
Subjects: 05C80
Related articles: Most relevant | Search more
arXiv:math/0409228 [math.CO] (Published 2004-09-14, updated 2006-11-07)
Hamilton Cycles in Digraphs of Unitary Matrices
arXiv:math/0009230 [math.CO] (Published 2000-09-26)
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
arXiv:math/0610977 [math.CO] (Published 2006-10-31)
New results related to a conjecture of Manickam and Singhi

Links

Toolbox