ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph. It is claw-free if it has no induced subgraph isomorphic to a claw, and GG is 4-connected if deleting fewer than four vertices does not disconnect it. Matthews–Sumner conjecture. Every 44-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.