Toughness and triangle-free graphs (Q1907099): Difference between revisions

We prove that there exist triangle-free graphs with arbitrarily large toughness, thereby settling a longstanding open question. We also explore the problem of whether there exists a \(t\)-tough, \(n/(t + 1)\)-regular, triangle-free graph on \(n\) vertices for various values of \(t\), and provide a relatively complete answer for small values of \(t\).