Steffen's conjecture on hypohamiltonian snarks
Statement
Let be a cubic graph. For each possible combination of 1-factors of , let be the minimum number of edges not contained in their union. A hypohamiltonian snark is a snark whose vertex-deleted subgraphs are Hamiltonian.
Steffen's conjecture. If is a hypohamiltonian snark, then
This conjecture concerns the minimum number of edges missed by three 1-factors in hypohamiltonian snarks; the supplied source does not state whether it has been resolved.
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.