Bipartite core conjecture for bridgeless cubic graphs
Statement
Let be a bridgeless cubic graph, and let a bipartite core mean a core whose underlying graph is bipartite. Bipartite core conjecture. Every bridgeless cubic graph has a bipartite core. The paper proves that this conjecture is equivalent to the cyclic core conjecture and hence to the Fan–Raspaud conjecture.
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.