Häggkvist–Markström Kotzig spanning-minor conjecture
Statement
A cubic graph is a graph in which every vertex has degree three. A cubic graph is a spanning minor of a cubic graph if some subdivision of is a spanning subgraph of . A Kotzig graph is a cubic graph with a 3-edge-coloring such that the union of any two color classes is a Hamilton circuit.
Häggkvist–Markström conjecture. Every -connected cubic graph contains a Kotzig graph as a spanning minor.
The conjecture would provide a broad sufficient condition for the circuit double cover conjecture, because a cubic graph containing a Kotzig graph as a spanning minor has a -even-subgraph double cover. The source also notes that -edge-connectivity is insufficient and that cyclical -edge-connectivity may be necessary.
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.