Adding random edges to create the square of a Hamilton cycle
Abstract
We consider how many random edges need to be added to a graph of order n with minimum degree α n in order that it contains the square of a Hamilton cycle w.h.p..
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.