ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \Gha\Gha be a finite cubic vertex transitive graph, and let MM be a perfect matching in \Gha\Gha. Write \Gha\M\Gha \backslash M for the graph obtained by deleting the edges of MM. Lovász's conjecture. There exists a perfect matching MM in \Gha\Gha such that \Gha\M\Gha \backslash M consists either of one cycle, in which case \Gha\Gha 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.