Timeline for Inclusion-preserving bijection between subsets of cardinality k and n-k
Current License: CC BY-SA 3.0
5 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 25, 2014 at 17:35 | vote | accept | Alex | ||
Dec 25, 2014 at 17:35 | |||||
Nov 28, 2014 at 17:06 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
+explicit description
|
Nov 28, 2014 at 16:13 | comment | added | Ira Gessel | See also Curtis Greene and Daniel J. Kleitman. Strong versions of Sperner’s theorem. J. Combinatorial Theory Ser. A, 20(1):80–88, 1976. For similar decompositions of other posets, search for "symmetric chain decomposition". | |
Nov 28, 2014 at 15:28 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
+references
|
Nov 28, 2014 at 12:34 | history | answered | Emil Jeřábek | CC BY-SA 3.0 |