Pages that link to "Item:Q3483322"
From MaRDI portal
The following pages link to Maximal Chains and Antichains in Boolean Lattices (Q3483322):
Displaying 16 items.
- On the size of maximal chains and the number of pairwise disjoint maximal antichains (Q710588) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- Cutsets and anti-chains in linear lattices (Q855880) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- Fibres and ordered set coloring (Q1177956) (← links)
- A note on maximal antichains in ordered sets (Q1205155) (← links)
- Minimum cutsets for an element of a Boolean lattice (Q1264164) (← links)
- Boolean layer cakes (Q1285779) (← links)
- Posets in which every cutset meets every fibre (Q1297476) (← links)
- Every cutset meets every fibre in certain poset products (Q1297482) (← links)
- Antichains and completely separating systems -- a catalogue and applications (Q2434732) (← links)
- Minimum sized fibres in distributive lattices (Q2747265) (← links)
- Edge‐cutsets in the directed hypercube (Q4537613) (← links)
- (Q5708609) (← links)
- On the \(f\)-vectors of cutsets in the Boolean lattice (Q5929842) (← links)
- Optimal Sets of Questions for Twenty Questions (Q6141868) (← links)
