ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An (n,v)(n,v)-multigraph is an nn-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 vv. Let v(n)v(n) be the minimum integer vv such that every (n,v)(n,v)-multigraph contains a rainbow matching of size nn. Grinblat's conjecture. For all n≥4n\geq 4,

v(n)=3n−2.v(n)=3n-2.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.