Mou and Pasechnik's Hamiltonicity conjecture for tough 2K_2-free graphs
Statement
A graph is -free if it has no induced subgraph consisting of two independent edges, and it is -tough if whenever deletion of leaves at least two components. A graph is hamiltonian if it has a spanning cycle.
Mou and Pasechnik's conjecture. Every -tough -free graph with at least three vertices is hamiltonian.
The source presents this as one of two conjectures proposed by Mou and Pasechnik and gives no resolution for it here.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.