The threshold for the square of a Hamilton cycle
Abstract
Resolving a conjecture of K\"uhn and Osthus from 2012, we show that p= 1/n is the threshold for the random graph Gn,p to contain the square of a Hamilton cycle.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.