Brualdi–Stein hypergraph matching conjecture
Statement
Let be an -regular -partite hypergraph with sides , , and , each of size . A pair of sides is simple if no pair of vertices from those sides belongs to more than one edge, and let denote the maximum size of a matching in . Brualdi–Stein hypergraph conjecture. If all three pairs , , and are simple, then
This is the hypergraph formulation of the partial-transversal conjecture for Latin squares and remains open in this generality.
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.