English

Nonhamiltonian Graphs with Given Toughness

Combinatorics 2012-09-18 v4

Abstract

In 1973, Chv\'{a}tal introduced the concept of toughness τ\tau of a graph and constructed an infinite class of nonhamiltonian graphs with τ=3/2\tau=3/2. Later Thomassen found nonhamiltonian graphs with τ>3/2\tau>3/2, and Enomoto et al. constructed nonhamiltonian graphs with τ=2ϵ\tau=2-\epsilon for each positive ϵ\epsilon. The last result in this direction is due to Bauer, Broersma and Veldman, which states that for each positive ϵ\epsilon, there exists a nonhamiltonian graph with τ9/4ϵ\tau\ge 9/4-\epsilon. In this paper we prove that for each rational number tt with 0<t<9/40<t<9/4, there exists a nonhamiltonian graph with τ=t\tau=t.

Keywords

Cite

@article{arxiv.1208.5463,
  title  = {Nonhamiltonian Graphs with Given Toughness},
  author = {Zh. G. Nikoghosyan},
  journal= {arXiv preprint arXiv:1208.5463},
  year   = {2012}
}

Comments

11 pages, corrected and improved version

R2 v1 2026-06-21T21:55:55.016Z