Applications of graph containers in the Boolean lattice
From MaRDI portal
Publication:2953701
DOI10.1002/rsa.20666zbMath1352.05142arXiv1602.05870OpenAlexW2963669358MaRDI QIDQ2953701
Adam Zsolt Wagner, Andrew Treglown, József Balogh
Publication date: 5 January 2017
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.05870
Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Arcs in \(\mathbb{F}_q^2\) ⋮ Multicolor chain avoidance in the Boolean lattice ⋮ Supersaturation in posets and applications involving the container method ⋮ Uniform chain decompositions and applications ⋮ On the number of high‐dimensional partitions ⋮ Independent sets in the middle two layers of Boolean lattice ⋮ Existence thresholds and Ramsey properties of random posets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A random version of Sperner's theorem
- Hypergraph containers
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- Intersection patterns of convex sets
- Simple hypergraphs with maximal number of adjacent pairs of edges
- An extremal problem for two families of sets
- On the number of graphs without 4-cycles
- On the minimum number of disjoint pairs in a family of finite sets
- Kleitman and combinatorics
- Intersecting families of discrete structures are typically trivial
- Counting independent sets in graphs
- Counting maximal antichains and independent sets
- Tilted Sperner families
- On a lemma of Littlewood and Offord on the distribution of certain sums
- A new type of coding problem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado in Random Hypergraphs
- The Asymptotic Number of Lattices
- Independent sets in hypergraphs
- Intersection theorems for systems of finite sets
- Optimal Codes in the Enomoto-Katona Space
- The number of K s,t -free graphs
- Stochastic Algorithms: Foundations and Applications
- On generalized graphs
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- On the Nonexistence of Perfect Codes over Finite Fields
This page was built for publication: Applications of graph containers in the Boolean lattice
