ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a maximal 33-γc\gamma_{c}-vertex critical graph, and let α\alpha, κ\kappa, and δ\delta denote its independence number, connectivity, and minimum degree, respectively. Assume

α=κ=δ.\alpha=\kappa=\delta.

Hamiltonian connectivity conjecture. Then GG is either the 55-cycle C5C_{5} or hamiltonian connected.

Together with the preceding result that every such graph with κ<δ\kappa<\delta is hamiltonian connected, this would establish that every maximal 33-γc\gamma_{c}-vertex critical graph is either C5C_{5} or hamiltonian connected. The conjecture concerns the remaining case α=κ=δ\alpha=\kappa=\delta and is presented as the needed step toward that conclusion.

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.