arXiv Analytics

Sign in

arXiv:1107.2201 [math.CO]AbstractReferencesReviewsResources

A Size Bound for Hamilton Cycles

Zh. G. Nikoghosyan

Published 2011-07-12Version 1

Every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$. The result is sharp.

Comments: 3 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1906.01433 [math.CO] (Published 2019-05-31)
Hamilton cycles in random graphs with minimum degree at least 3: an improved analysis
arXiv:0904.0431 [math.CO] (Published 2009-04-02, updated 2020-08-26)
Hamilton cycles in 3-out
arXiv:1901.07139 [math.CO] (Published 2019-01-22)
Hamilton Cycles in Random Graphs: a bibliography

Links

Toolbox