Maximal independent sets in the covering graph of the cube
From MaRDI portal
(Redirected from Publication:385145)
Recommendations
Cites work
- scientific article; zbMATH DE number 3825713 (Why is no real title available?)
- Entropy, independent sets and antichains: A new approach to Dedekind's problem
- Enumeration of intersecting families
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite sets
- Maximal independent sets in bipartite graphs obtained from Boolean lattices
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- On Dedekind's Problem: The Number of Monotone Boolean Functions
- On cliques in graphs
- On the number of antichains in multilevelled ranked posets
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(8)- Maximal independent sets and separating covers
- On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)
- Order structure of good sets in hypercube
- Independent sets in graphs
- The number of maximal independent sets in the Hamming cube
- scientific article; zbMATH DE number 3859176 (Why is no real title available?)
- Stability for maximal independent sets
- Counting maximal antichains and independent sets
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)