Triangle-Free Graphs of Toughness Approaching Two Without a 2-Factor

Songling Shan

By work of Enomoto, Jackson, Katerinis, and Saito from 1985, every $2$-tough graph has a $2$-factor, and this toughness bound is best possible: for every $\epsilon >0$, there exi…