Win's conjecture on disjoint perfect matchings under an Ore-type condition
Statement
Let be two integers such that
and is even. Let be a graph on vertices. A graph is of Ore-type- if every pair of nonadjacent vertices satisfies
Win's conjecture. If is of Ore-type-, then contains disjoint perfect matchings.
The conjecture is known for , and the paper proves it for all sufficiently large even when . The general case remains open according to the source.
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.