On the minimum degree of minimally $t$-tough, claw-free graphs

Hui Ma, Xiaomin Hu, Weihua Yang

A graph $G$ is minimally $t$-tough if the toughness of $G$ is $t$ and deletion of any edge from $G$ decreases its toughness. Katona et al. conjectured that the minimum de…