Acyclic complement of two 1-factors conjecture
Statement
Let be a bridgeless cubic graph, and let be 1-factors of . Acyclic two-matchings conjecture. There exist two 1-factors such that the complement of their union is acyclic. The paper identifies this as a stronger version of the three-1-factor acyclic-complement conjecture and explicitly disproves it.
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.