Union-closed families of sets (Q5906403)

A finite family \(F\) of sets is called union-closed if \(A\cup B \in F\) whenever \(A,B\in F\). Let \(u(n)\) be the maximum number such that for each union-closed family \(F\) with \(n\) sets there exists an element \(x\) which is contained in at least \(u(n)\) members of \(F\). Frankl conjectured that \(u(n)\geq n/2\) for \(n\geq 2\). Improving a result of E. Knill the author of this paper proves that \[ u(n)>{1+o(1) \over \log_2(4/3)} {n\over \log_2n}. \] For the proof he determines the minimum number of sets of size \(\leq k\) in an ideal of \(n\) sets. This result follows easily from a general theorem on the maximum weight of ideals of given size in rank-greedy Macaulay posets; cf. \textit{K. Engel} [Sperner theory, Cambridge University Press (1997; Zbl 0868.05001)]. One has to use the weight function \(w\) given by \[ w(A)=\begin{cases} 1\quad &\text{if }| A|>k,\\ 0\quad &\text{if }| A|\leq k.\end{cases} \] {}.