1 paper
Songling Shan, Zachary Warren
Let t≥1 be an integer, and let G be a t-tough n-vertex graph with degree sequence d1,d2,…,dn in non-decreasing order. In 1995, Hoàng conjectured that if $G…