Hamilton Cycles in 10-Tough $(2P_2\cup P_1)$-Free Graphs

Qiuyu Chen

A graph is called 10-tough and $(2P_2\cup P_1)$-free if every vertex set whose deletion leaves at least two components has cardinality at least ten times the number of those compo…