Delcourt–Postle conjecture on full rainbow matchings in multigraphs
Statement
Let be a multigraph with maximum degree , and let be color classes of a proper edge-coloring of . A full rainbow matching is a matching containing exactly one edge from each color class. Delcourt–Postle conjecture. If for every , then 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.