A Note on Hamilton Cycles
Combinatorics
2012-09-28 v1
Abstract
If is a more than one tough graph on vertices with for a given and is large enough then is hamiltonian.
Cite
@article{arxiv.1209.6149,
title = {A Note on Hamilton Cycles},
author = {Zh. G. Nikoghosyan},
journal= {arXiv preprint arXiv:1209.6149},
year = {2012}
}
Comments
2 pages