ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be an nn-regular 33-partite hypergraph with sides AA, BB, and CC, each of size nn. A pair of sides is simple if no pair of vertices from those sides belongs to more than one edge, and let ν(H)\nu(H) denote the maximum size of a matching in HH. Brualdi–Stein hypergraph conjecture. If all three pairs (A,B)(A,B), (B,C)(B,C), and (A,C)(A,C) are simple, then

ν(H)≥n−1.\nu(H)\ge n-1.

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 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.