Lovász's perfect-matching conjecture for cubic vertex transitive graphs
Statement
Let be a finite cubic vertex transitive graph, and let be a perfect matching in . Write for the graph obtained by deleting the edges of . Lovász's conjecture. There exists a perfect matching in such that consists either of one cycle, in which case is Hamiltonian, or of two disjoint cycles of the same length. If true, this would imply that all finite vertex transitive cubic graphs have a uniform partite presentation; the source describes the conjecture as still open.
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.