## Abstract

A central theorem in combinatorics is Sperner's Theorem, which determines the maximum size of a family F⊆P(n) that does not contain a 2-chain F_{1}⊊F_{2}. Erdős later extended this result and determined the largest family not containing a k-chain F_{1}⊊…⊊F_{k}. Erdős and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result. This question was resolved for 2-chains by Kleitman in 1966, who showed that amongst families of size M in P(n), the number of 2-chains is minimized by a family whose sets are taken as close to the middle layer as possible. He also conjectured that the same conclusion should hold for all k, not just 2. The best result on this question is due to Das, Gan and Sudakov who showed that Kleitman's conjecture holds for families whose size is at most the size of the k+1 middle layers of P(n), provided k≤n−6. Our main result is that for every fixed k and ε>0, if n is sufficiently large then Kleitman's conjecture holds for families of size at most (1−ε)2^{n}, thereby establishing Kleitman's conjecture asymptotically. Our proof is based on ideas of Kleitman and Das, Gan and Sudakov. Several open problems are also given.

Original language | English (US) |
---|---|

Pages (from-to) | 229-252 |

Number of pages | 24 |

Journal | Advances in Mathematics |

Volume | 330 |

DOIs | |

State | Published - May 25 2018 |

## Keywords

- Boolean lattice
- Chains
- Supersaturation

## ASJC Scopus subject areas

- Mathematics(all)