A Size Bound for Hamilton Cycles
Combinatorics
2011-07-13 v1
Abstract
Every graph of size (the number of edges) and minimum degree is hamiltonian if . The result is sharp.
Keywords
Cite
@article{arxiv.1107.2201,
title = {A Size Bound for Hamilton Cycles},
author = {Zh. G. Nikoghosyan},
journal= {arXiv preprint arXiv:1107.2201},
year = {2011}
}
Comments
3 pages