Simple 3-partite hypergraph generalization of Drisko's theorem
Statement
Let be a simple -partite hypergraph with sides , , and , where simplicity means that no edge is repeated. Let denote the maximum matching size. Generalized Drisko conjecture. If
then
This is proposed as a simple-hypergraph generalization of the sharp rainbow matching theorem; its status is not resolved in the supplied text.
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.