ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a multigraph with maximum degree Δ\Delta, and let E1,…,EnE_1,\ldots,E_n be color classes of a proper edge-coloring of GG. A full rainbow matching is a matching containing exactly one edge from each color class. Delcourt–Postle conjecture. If ∣Ei∣≥Δ+2|E_i|\geq \Delta+2 for every ii, then GG has a full rainbow matching. The source later states that both this conjecture and the preceding bipartite conjecture are false, even when the chromatic index equals the maximum degree; consequently this conjecture is refuted.

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.