ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F\mathcal{F} be a union-closed set family, and let its ground set have size at least kk. An element is said to appear in a set when it belongs to that set.

Nagel's conjecture. There are kk elements, each belonging to at least

12k−1+1∣F∣\frac{1}{2^{k-1}+1}|\mathcal{F}|

many sets in F\mathcal{F}.

This strengthens the Union-Closed Sets Conjecture, also known as Frankl's conjecture, which is the case k=1k=1. Das and Wu proved the claim for k≥3k\geq 3 and for k=2k=2 when ∣F∣|\mathcal{F}| lies outside a particular range; the remaining cases for k=2k=2 are analysed via linear programming in the paper.

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.