ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cubic graph is a graph in which every vertex has degree three. A cubic graph HH is a spanning minor of a cubic graph GG if some subdivision of HH is a spanning subgraph of GG. 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 33-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 66-even-subgraph double cover. The source also notes that 33-edge-connectivity is insufficient and that cyclical 44-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 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.