Supersaturation in the Boolean lattice
From MaRDI portal
Publication:5262057
zbMATH Open1316.05119arXiv1303.4336MaRDI QIDQ5262057FDOQ5262057
Jean-Sébastien Sereni, Ross J. Kang, Andrew P. Dove, J. Griggs
Publication date: 9 July 2015
Abstract: We prove a "supersaturation-type" extension of both Sperner's Theorem (1928) and its generalization by Erdos (1945) to k-chains. Our result implies that a largest family whose size is x more than the size of a largest k-chain free family and that contains the minimum number of k-chains is the family formed by taking the middle (k-1) rows of the Boolean lattice and x elements from the k-th middle row. We prove our result using the symmetric chain decomposition method of de Bruijn, van Ebbenhorst Tengbergen, and Kruyswijk (1951).
Full work available at URL: https://arxiv.org/abs/1303.4336
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Sperner's theorem and a problem of Erdős, Katona and Kleitman
- Subsets of posets minimising the number of chains
- Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
- Supersaturation in posets and applications involving the container method
- On saturated \(k\)-Sperner systems
Cited In (17)
- Solution to a problem of Katona on counting cliques of weighted graphs
- Structure and supersaturation for intersecting families
- Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains
- Long symmetric chains in the Boolean lattice
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
- Families in posets minimizing the number of comparable pairs
- Supersaturation, counting, and randomness in forbidden subposet problems
- Supersaturation in posets and applications involving the container method
- Comparable pairs in families of sets
- On the number of monotone sequences
- Supersaturation and stability for forbidden subposet problems.
- Subsets of posets minimising the number of chains
- A generalization of the independence number
- Set Systems Containing Many Maximal Chains
- The number of additive triples in subsets of abelian groups
- On some extremal and probabilistic questions for tree posets
- Supersaturation, counting, and randomness in forbidden subposet problems
This page was built for publication: Supersaturation in the Boolean lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262057)
