The rainbow matching conjecture for general graphs
Statement
Let mean that every matchings of size in any graph have a rainbow matching of size . The notation has the same meaning for bipartite graphs. Rainbow matching conjecture.
If is odd, then
The bipartite analogue 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.