ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A snark is a bridgeless cubic graph that is not 3-edge-colourable, and a graph is cyclically 4-edge-connected if no edge cut of size less than 44 separates two components each containing a circuit. A dominating circuit in a graph GG is a circuit CC such that every edge of GG has an end-vertex on CC.

Fleischner's dominating circuit conjecture. Every cyclically 44-edge-connected snark has a dominating circuit.

The conjecture is one of several equivalent forms of the dominating-cycle problem and is related to the Matthews–Sumner conjecture on hamiltonian claw-free graphs. The source reports computational verification that it has no counterexample on 3636 or fewer vertices, but its general status remains open.

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.