A Note on Hamilton Cycles
Abstract
If G is a more than one tough graph on n vertices with δ n2-a for a given a>0 and n is large enough then G is hamiltonian.
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.