ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cubic graph. For each possible combination of kk 1-factors of GG, let μk(G)\mu_k(G) 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 GG is a hypohamiltonian snark, then

μ3(G)=3.\mu_3(G)=3.

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 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.