ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an essentially 66-edge-connected 44-regular graph with a transition system TT. A compatible cycle decomposition is a cycle decomposition compatible with the transitions prescribed by TT.

Fleischner's conjecture. The pair (G,T)(G,T) has no compatible cycle decomposition if and only if (G,T)(G,T) is the bad loop or the bad K5K_5.

The source lists this conjecture among claims for which finitely many counterexamples had already been found by computer search, and its construction is presented as part of the counterexample context.

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.