Maximal independent sets in bipartite graphs obtained from Boolean lattices

DOI10.1016/j.ejc.2010.08.004zbMath1203.05075OpenAlexW1999750683MaRDI QIDQ607358

Vojtěch Rödl, Peter Frankl, Dwight Duffus

Publication date: 22 November 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2010.08.004

zbMATH Keywords

antichain in Boolean latticeindpendent sets in bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structure theory of lattices (06B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

Counting maximal antichains and independent sets ⋮ Maximal independent sets in the covering graph of the cube ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ Applications of graph containers in the Boolean lattice ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ Antichains and completely separating systems -- a catalogue and applications ⋮ The graph formulation of the union-closed sets conjecture ⋮ Independent sets in the middle two layers of Boolean lattice ⋮ Perfect matchings in antipodally colored lattice of subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Entropy, independent sets and antichains: A new approach to Dedekind’s problem
• On the number of antichains in multilevelled ranked posets
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Monotone Boolean functions
• On Dedekind's Problem: The Number of Monotone Boolean Functions

This page was built for publication: Maximal independent sets in bipartite graphs obtained from Boolean lattices