Pages that link to "Item:Q2376906"
From MaRDI portal
The following pages link to Counting maximal antichains and independent sets (Q2376906):
Displaying 16 items.
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Maximal independent sets in bipartite graphs obtained from Boolean lattices (Q607358) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- Antichains, the stick principle, and a matching number (Q1731335) (← links)
- Independent sets in the middle two layers of Boolean lattice (Q2221816) (← links)
- Stability for maximal independent sets (Q2309229) (← links)
- Counting proper mergings of chains and antichains (Q2449169) (← links)
- The number of maximal independent sets in the Hamming cube (Q2678457) (← links)
- Maximum-size antichains in random set-systems (Q2820272) (← links)
- The number of maximal sum-free subsets of integers (Q2944846) (← links)
- Applications of graph containers in the Boolean lattice (Q2953701) (← links)
- An upper bound of the cardinality of antichain boundary in the n-cube (Q3970876) (← links)
- An isoperimetric inequality for the Hamming cube and some consequences (Q5117318) (← links)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7 (Q6040344) (← links)
- Approximately counting independent sets in bipartite graphs via graph containers (Q6074723) (← links)
