The Toughness of Kneser Graphs

Davin Park, Anthony Ostuni, Nathan Hayes +4

The \textit{toughness} $t(G)$ of a graph $G$ is a measure of its connectivity that is closely related to Hamiltonicity. Brouwer proved the lower bound $t(G)>\ell /\lambda -2$ on the t…