Pages that link to "Item:Q607358"
From MaRDI portal
The following pages link to Maximal independent sets in bipartite graphs obtained from Boolean lattices (Q607358):
Displaying 12 items.
- Maximal independent sets in the covering graph of the cube (Q385145) (← links)
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- Perfect matchings in antipodally colored lattice of subsets (Q1761465) (← links)
- Bipartite graphs can have any number of independent sets (Q1823265) (← links)
- Independent sets in the middle two layers of Boolean lattice (Q2221816) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- Counting maximal antichains and independent sets (Q2376906) (← links)
- Antichains and completely separating systems -- a catalogue and applications (Q2434732) (← links)
- Applications of graph containers in the Boolean lattice (Q2953701) (← links)
- Maximal independent sets in bipartite graphs (Q3137766) (← links)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7 (Q6040344) (← links)