ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a simple 33-partite hypergraph with sides AA, BB, and CC, where simplicity means that no edge is repeated. Let ν(H)\nu(H) denote the maximum matching size. Generalized Drisko conjecture. If

∣A∣=2n−1,|A|=2n-1, deg⁡(a)≥nfor every a∈A,\deg(a)\ge n\quad\text{for every }a\in A, deg⁡(v)≤2n−1for every v∈B∪C,\deg(v)\le 2n-1\quad\text{for every }v\in B\cup C,

then

ν(H)≥n.\nu(H)\ge n.

This is proposed as a simple-hypergraph generalization of the sharp 2n−12n-1 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 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.