Qiuyu Chen

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

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 components and if the graph has no induced subgraph consisting of two disjoint edges and an isolated vertex. We prove that every finite simple 10...