The following pages link to k-color Sperner theorems (Q1080849):
Displaying 19 items.
- A tour of \(M\)-part \(L\)-Sperner families (Q618322) (← links)
- On the admissible values of one parameter for maximal Sperner families of subsets of the type \((k, k+1)\) (Q954159) (← links)
- Colorful flowers (Q1013831) (← links)
- A Ramsey-Sperner theorem (Q1070227) (← links)
- All maximum 2-part Sperner families (Q1088662) (← links)
- Convex hulls of more-part Sperner families (Q1115870) (← links)
- A Sperner-type theorem and qualitative independence (Q1185884) (← links)
- Sperner systems containing at most \(k\) sets of every cardinality (Q1363663) (← links)
- Ramsey-Sperner theory (Q1821793) (← links)
- Efficient formula of the colored Kauffman brackets (Q1888634) (← links)
- Multicolored subsets in colored hypergraphs (Q1914009) (← links)
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- The linear chromatic number of a Sperner family (Q2449097) (← links)
- (Q3424786) (← links)
- Open problems on linear sperner families and lattices (Q3653755) (← links)
- On an inequality of Sperner (Q3972014) (← links)
- A proof of W. T. Gowers’ $c_0$ theorem (Q4813751) (← links)
- Imbalances in k‐colorations (Q5661913) (← links)
