Grinblat's conjecture on rainbow matchings in (n,v)-multigraphs
Statement
An -multigraph is an -edge-coloured multigraph in which the edges of each colour span a disjoint union of non-trivial cliques whose total number of vertices is at least . Let be the minimum integer such that every -multigraph contains a rainbow matching of size . Grinblat's conjecture. For all ,
This problem generalises rainbow matching questions such as the bipartite Aharoni–Berger conjecture and arose from Grinblat's study of algebras of sets; the conjecture remains open here.
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.