Fleischner's conjecture on compatible cycle decompositions
Statement
Let be an essentially -edge-connected -regular graph with a transition system . A compatible cycle decomposition is a cycle decomposition compatible with the transitions prescribed by .
Fleischner's conjecture. The pair has no compatible cycle decomposition if and only if is the bad loop or the bad .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.