Counting maximal antichains and independent sets
From MaRDI portal
Publication:2376906
DOI10.1007/s11083-012-9253-5zbMath1297.06005arXiv1202.4427OpenAlexW2087817066MaRDI QIDQ2376906
Publication date: 26 June 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4427
Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (10)
The number of maximal sum-free subsets of integers ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ The number of maximal independent sets in the Hamming cube ⋮ Applications of graph containers in the Boolean lattice ⋮ Approximately counting independent sets in bipartite graphs via graph containers ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ An isoperimetric inequality for the Hamming cube and some consequences ⋮ The graph formulation of the union-closed sets conjecture ⋮ Independent sets in the middle two layers of Boolean lattice ⋮ Stability for maximal independent sets
Cites Work
- Maximal independent sets in the covering graph of the cube
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- An upper bound for the number of independent sets in regular graphs
- Some intersection theorems for ordered sets and graphs
- Parametrized complexity theory.
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- The Number of Independent Sets in a Regular Graph
- The Number of Maximal Independent Sets in Triangle-Free Graphs
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- On cliques in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Counting maximal antichains and independent sets
