Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
From MaRDI portal
Publication:5364244
DOI10.1017/S0963548314000273zbMath1371.05295arXiv1302.5210OpenAlexW2962741068MaRDI QIDQ5364244
Shagnik Das, Wenying Gan, Benjamin Sudakov
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.5210
Related Items
Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains ⋮ Supersaturation, counting, and randomness in forbidden subposet problems ⋮ A generalization of the independence number ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ Supersaturation in posets and applications involving the container method ⋮ Structure and supersaturation for intersecting families ⋮ On some extremal and probabilistic questions for tree posets ⋮ Families in posets minimizing the number of comparable pairs ⋮ Solution to a problem of Katona on counting cliques of weighted graphs ⋮ A short note on supersaturation for oddtown and eventown ⋮ The number of additive triples in subsets of abelian groups ⋮ Set Systems Containing Many Maximal Chains ⋮ A random version of Sperner's theorem ⋮ On the number of \(K_4\)-saturating edges ⋮ Subsets of posets minimising the number of chains ⋮ Supersaturation and stability for forbidden subposet problems. ⋮ On the number of monotone sequences ⋮ Comparable pairs in families of sets ⋮ A note on supersaturated set systems ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ Maximum-size antichains in random set-systems ⋮ Colouring set families without monochromatic \(k\)-chains
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The minimum number of disjoint pairs in set systems and related problems
- On a theorem of Rademacher-Turán
- A generalization of Sperner's theorem and an application to graph orientations
- On induced subgraphs of the cube
- Extremal problems among subsets of a set
- Supersaturation in the Boolean lattice
- On a lemma of Littlewood and Offord
