Supersaturation and stability for forbidden subposet problems.
From MaRDI portal
Publication:490923
DOI10.1016/j.jcta.2015.07.004zbMath1322.06002arXiv1406.1887OpenAlexW1826102021MaRDI QIDQ490923
Publication date: 21 August 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1887
Combinatorics of partially ordered sets (06A07) Combinatorial inequalities (05A20) Extremal set theory (05D05)
Related Items (4)
Supersaturation, counting, and randomness in forbidden subposet problems ⋮ Supersaturation in posets and applications involving the container method ⋮ The saturation spectrum for antichains of subsets ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Cites Work
- The minimum number of disjoint pairs in set systems and related problems
- Diamond-free families
- On a theorem of Rademacher-Turán
- Supersaturated graphs and hypergraphs
- Simple hypergraphs with maximal number of adjacent pairs of edges
- On a problem of Kleitman and West
- On the minimum number of disjoint pairs in a family of finite sets
- Set systems with few disjoint pairs
- Set families with a forbidden subposet
- Largest family without \(A \cup B \subseteq C \cap D\)
- Logarithmic order of free distributive lattice
- Set Families With a Forbidden Induced Subposet
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Families of Subsets With a Forbidden Subposet
- Graphs with maximal number of adjacent pairs of edges
- Supersaturation in the Boolean lattice
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- On generalized graphs
- A short proof of Sperner's lemma
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
- On a lemma of Littlewood and Offord
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Supersaturation and stability for forbidden subposet problems.
