ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n,kn,k be two integers such that

1≤k≤n−21\leq k\leq n-2

and nn is even. Let GG be a graph on nn vertices. A graph is of Ore-type-(k−2)(k-2) if every pair of nonadjacent vertices u,vu,v satisfies

d(u)+d(v)≥∣G∣+k−2.d(u)+d(v)\geq |G|+k-2.

Win's conjecture. If GG is of Ore-type-(k−2)(k-2), then GG contains kk disjoint perfect matchings.

The conjecture is known for k=1,2,3k=1,2,3, and the paper proves it for all sufficiently large even nn when k≥n/2k\geq n/2. 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 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.