The even-cycle decomposition conjecture for odd-K_5-minor-free signed graphs
Statement
A signed graph is a graph whose edges are designated even or odd; a cycle is even when it contains an even number of odd edges. A graph is even cycle decomposable if its edge set can be partitioned into even cycles. The graph is Eulerian if every vertex has even degree, and odd--minor free if it has no odd minor of . Even-cycle decomposition conjecture. Every -connected Eulerian loopless odd--minor-free signed graph with an even number of odd edges is even cycle decomposable. This conjecture extends the known results for bipartite graphs and graphs with no -minor, where the corresponding necessary conditions are sufficient for an even-cycle decomposition.
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.