ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cubic graph with a perfect matching mathcalMmathcal M such that G/mathcalMG / mathcal M is 44-connected. A cycle dominates mathcalMmathcal M if it contains at least one endpoint of every edge of mathcalMmathcal M. Dominating-cycle conjecture. The graph GG contains a cycle that dominates mathcalMmathcal M. This conjecture is equivalent to the Dominating Cycle Conjecture, which asserts that every cyclically 44-edge-connected cubic graph has a dominating cycle; the supplied text gives no resolution.

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.