ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cubic graph is a graph in which every vertex has degree 33. A graph is cyclically 44-edge connected if no edge cut of fewer than four edges separates two subgraphs each containing a cycle. A Kotzig graph is a cubic graph admitting a proper 33-edge-coloring such that each bicolored cycle is hamiltonian. For a 22-connected cubic graph GG, a Kotzig-frame is a spanning subgraph FF such that every component of FF has an even number of vertices and every component is either a cycle or a subdivision of a Kotzig graph.

Kotzig-frame existence conjecture. Every cyclically 44-edge connected cubic graph has a Kotzig-frame.

The paper notes that no cyclically 44-edge connected cubic graph without a Kotzig-frame was known at the time. A Kotzig-frame can yield a cycle double cover under additional conditions, so establishing the conjecture would support the cycle double cover program.

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.