ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Kn,nK_{n,n} be the complete bipartite graph with nn vertices in each part. For bipartite subgraphs F1,…,Fk⊆Kn,nF_1,\ldots,F_k\subseteq K_{n,n}, a rainbow matching is a choice of pairwise vertex-disjoint edges ei∈Fie_i\in F_i.

Nested-size bipartite rainbow matching conjecture. If Fi⊆Kn,nF_i\subseteq K_{n,n} for i≤ki\leq k and

∣Fi∣≥in|F_i|\geq in

for every i≤ki\leq k, then F1,…,FkF_1,\ldots,F_k have a rainbow matching.

The source presents this as a simpler counterpart of its main bipartite theorem and says that it is believed to be true. Its status is unresolved in 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.