Chi-Yao Cheng

Extremal Families for the Erd\H{o}s--Kleitman Problem: The Missing Constructions

For integers $n\ge s\ge2$, let $e(n,s)$ be the maximum size of a family $\mathcal F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e(n,s)$, now called the Erd\H{o}s--Kleitman problem, is closely related to the well-known Erd\H{o}s matching problem. Frankl and Kupavskii posed a meta-...