Maximal independent sets in the covering graph of the cube

DOI10.1016/j.dam.2010.09.003zbMath1277.05087OpenAlexW2000803309MaRDI QIDQ385145

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

Publication date: 29 November 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.09.003

zbMATH Keywords

maximal independent setcover graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Counting maximal antichains and independent sets ⋮ The number of maximal independent sets in the Hamming cube ⋮ On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\) ⋮ Independent sets in graphs ⋮ Stability for maximal independent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Maximal independent sets in bipartite graphs obtained from Boolean lattices
• Enumeration of intersecting families
• Entropy, independent sets and antichains: A new approach to Dedekind’s problem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the number of antichains in multilevelled ranked posets
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Intersection theorems for systems of finite sets
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• On cliques in graphs

This page was built for publication: Maximal independent sets in the covering graph of the cube