Maximal independent sets in the covering graph of the cube
DOI10.1016/J.DAM.2010.09.003zbMATH Open1277.05087OpenAlexW2000803309MaRDI QIDQ385145FDOQ385145
Dwight Duffus, Peter Frankl, Vojtěch Rödl
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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Enumeration in graph theory (05C30)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On cliques in graphs
- Title not available (Why is that?)
- 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
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- On the number of antichains in multilevelled ranked posets
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- Enumeration of intersecting families
Cited In (6)
This page was built for publication: Maximal independent sets in the covering graph of the cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385145)
