The following pages link to Saturating Sperner families (Q367051):
Displaying 12 items.
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- Almost all permutation matrices have bounded saturation functions (Q831345) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316) (← links)
- Induced and non-induced poset saturation problems (Q2049440) (← links)
- Saturation for small antichains (Q2111774) (← links)
- Improved bounds for induced poset saturation (Q2185221) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube. II (Q2225404) (← links)
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) (Q2323091) (← links)
- Saturation of Ordered Graphs (Q6100612) (← links)
- The saturation spectrum for antichains of subsets (Q6139859) (← links)
- The induced saturation problem for posets (Q6204679) (← links)
