Next: Latka
Abstract
Up: Index of
Abstracts
Previous: Sundaram
Abstract
Conjecture: There exists t_0 such that every t_0-tough graph on at least three vertices is hamiltonian.
It has been shown that if this conjecture is true, then t_0 >=2. Direct progress on this "2-tough" conjecture has been minimal. However, this conjecture is closely related to several well-known theorems and conjectures and equivalent to yet others. Some recent results of this "family" of theorems and conjectures will be discussed.