ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (m,n)→k(m,n)\to k mean that every mm matchings of size nn in any graph have a rainbow matching of size kk. The notation (m,n)→Bk(m,n)\to_{\mathcal{B}} k has the same meaning for bipartite graphs. Rainbow matching conjecture.

(2n,n)→n.(2n,n)\to n.

If nn is odd, then

(2n−1,n)→n.(2n-1,n)\to n.

The bipartite analogue (2n−1,n)→Bn(2n-1,n)\to_{\mathcal{B}}n is known by Drisko's theorem. The conjecture asserts that passing from bipartite graphs to general graphs costs only one additional matching; it remains open in the supplied 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.