The following pages link to A short proof of Sperner's lemma (Q5529497):
Displayed 50 items.
- Two new perspectives on multi-stage group testing (Q378258) (← links)
- Sperner type theorems with excluded subposets (Q385154) (← links)
- Manipulating the quota in weighted voting games (Q420828) (← links)
- A new proof of the density Hales-Jewett theorem (Q431641) (← links)
- Minimum number of affine simplices of given dimension (Q476315) (← links)
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- Tight bounds for adopt-commit objects (Q487260) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- An adaptive algorithm for group testing for complexes (Q500957) (← links)
- On the linear extension complexity of regular \(n\)-gons (Q513256) (← links)
- A Sperner theorem on unrelated chains of subsets (Q594865) (← links)
- A tour of \(M\)-part \(L\)-Sperner families (Q618322) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- On nested chain decompositions of normalized matching posets of rank 3 (Q634742) (← links)
- Diamond-free families (Q654889) (← links)
- Families of subsets without a given poset in double chains and Boolean lattices (Q722595) (← links)
- An application of Dilworth's lattice of maximal antichains (Q759153) (← links)
- \(Q _{2}\)-free families in the Boolean lattice (Q766139) (← links)
- Investigating posets via their maximal chains (Q781532) (← links)
- Some remarks on normalized matching (Q787981) (← links)
- On Helly families of maximal size (Q793730) (← links)
- Helly-type hypergraphs and Sperner families (Q794670) (← links)
- Intersecting Sperner families and their convex hulls (Q796532) (← links)
- Packing posets in the Boolean lattice. (Q890020) (← links)
- An identity in combinatorial extremal theory (Q917551) (← links)
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\) (Q953271) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Optimal conclusive sets for comparator networks (Q1008736) (← links)
- \(l\)-trace \(k\)-Sperner families of sets (Q1024991) (← links)
- The Sperner property for posets: A probabilistic approach (Q1057860) (← links)
- k-color Sperner theorems (Q1080849) (← links)
- All maximum 2-part Sperner families (Q1088662) (← links)
- The number of unrelated partitions (Q1112025) (← links)
- Some results on Sperner families (Q1132876) (← links)
- On Sperner families in which no k sets have an empty intersection (Q1134158) (← links)
- On counting Sperner families (Q1137998) (← links)
- On maximal families of subsets of a finite set (Q1147702) (← links)
- On maximal antichains consisting of sets and their complements (Q1150366) (← links)
- Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions (Q1151395) (← links)
- On maximal antichains containing no set and its complement (Q1154463) (← links)
- On Sperner families in which no k sets have an empty intersection. II (Q1157326) (← links)
- Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets (Q1158173) (← links)
- On Sperner families in which no k sets have an empty intersection. III (Q1167724) (← links)
- A probabilistic proof for the Lym-inequality (Q1172055) (← links)
- The local Kostant-PBW ordering (Q1175976) (← links)
- Sharpening the LYM inequality (Q1200274) (← links)
- Helly property in finite set systems (Q1208035) (← links)
- Sperner's theorem with constraints (Q1212460) (← links)
- The morphology of partially ordered sets (Q1213863) (← links)
- Orthogonal structures on finite partial orders (Q1214417) (← links)