Matthews–Sumner conjecture on Hamilton cycles in 4-connected claw-free graphs
Statement
Let be a graph. It is claw-free if it has no induced subgraph isomorphic to a claw, and is 4-connected if deleting fewer than four vertices does not disconnect it. Matthews–Sumner conjecture. Every -connected, claw-free graph has a Hamiltonian cycle.
This is a central conjecture on Hamiltonicity in sparse graphs. The supplied paper describes it as a famous open problem and discusses it as motivation for a bipartite analogue.
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.