ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P([n])\mathscr{P}([n]) be the power set of [n][n]. A family F⊆P([n])\mathcal{F}\subseteq\mathscr{P}([n]) is a (2ℓ+1)(2\ell+1)-union antichain if it is an antichain and ∣F∪F′∣≤2ℓ+1\lvert F\cup F'\rvert\leq 2\ell+1 for every F,F′∈FF,F'\in\mathcal{F}. Write δ(F)\delta(\mathcal{F}) for its minimum degree.

Kiselev–Kupavskii–Patkós' conjecture. If 1≤2ℓ+1<n1\leq 2\ell+1<n and F⊆P([n])\mathcal{F}\subseteq\mathscr{P}([n]) is a (2ℓ+1)(2\ell+1)-union antichain, then

δ(F)≤(n−1ℓ−1).\delta(\mathcal{F})\leq\binom{n-1}{\ell-1}.

The conjecture concerns the minimum degree of union antichains and is equivalent to their conjecture on the diversity of an intersecting antichain. Its resolution is not given 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.