Multiplicity Ryser-Brualdi-Stein conjecture
Statement
Let be a complete bipartite graph on vertices whose edge set is decomposed into perfect matchings , for . Let be nonnegative integers satisfying
A matching with prescribed multiplicities is a matching whose intersection with each has the specified size. Multiplicity Ryser-Brualdi-Stein conjecture. There exists a matching in such that
for every . The conjecture extends the rainbow matching formulation by prescribing how many edges are selected from each color class; the paper presents it as an open conjecture and proves the three-color case.
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.