加载中…
The Union-Closed Sets Conjecture, also known as Frankl’s conjecture, asks whether, for any union-closed set family with sets, there is an element that lies in at least sets in . In 2022, Nagel posed a stronger conjecture that within any union-closed family whose ground set size is at least , there are always elements in the ground set that appear in at least proportion of the sets in the family. Das and Wu showed that this conjecture is true for and if is outside a particular range. In this companion paper, we analyse further when fails Nagel’s conjecture for via linear programming.

生成讲解博客的中文版本

生成AI智能校验的中文版本