Nagel's conjecture on multiple frequent elements in union-closed families
Statement
Let be a union-closed set family, and let its ground set have size at least . An element is said to appear in a set when it belongs to that set.
Nagel's conjecture. There are elements, each belonging to at least
many sets in .
This strengthens the Union-Closed Sets Conjecture, also known as Frankl's conjecture, which is the case . Das and Wu proved the claim for and for when lies outside a particular range; the remaining cases for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.