English

A Note on Hamilton Cycles

Combinatorics 2012-09-28 v1

Abstract

If GG is a more than one tough graph on nn vertices with δn2a\delta\ge \frac{n}{2}-a for a given a>0a>0 and nn is large enough then GG is hamiltonian.

Keywords

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

R2 v1 2026-06-21T22:12:00.699Z