The maximal 3-gamma_c-vertex critical graph Hamiltonian connectivity conjecture
Statement
Let be a maximal --vertex critical graph, and let , , and denote its independence number, connectivity, and minimum degree, respectively. Assume
Hamiltonian connectivity conjecture. Then is either the -cycle or hamiltonian connected.
Together with the preceding result that every such graph with is hamiltonian connected, this would establish that every maximal --vertex critical graph is either or hamiltonian connected. The conjecture concerns the remaining case 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.