Nested-size bipartite rainbow matching conjecture
Statement
Let be the complete bipartite graph with vertices in each part. For bipartite subgraphs , a rainbow matching is a choice of pairwise vertex-disjoint edges .
Nested-size bipartite rainbow matching conjecture. If for and
for every , then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.