Claims

../

1978_11_01_lovasz: A t-coloring of the r-subsets of an n-set with n at least 2r + t - 1 has two disjoint sets of one color: the chromatic number of the Kneser graph, the case k = 2 of the problem, proved topologically.

1986_11_01_alon_frankl_lovasz: A t-coloring of the r-subsets of an n-set with n at least kr + (t-1)(k-1) has k pairwise disjoint sets of one color: the chromatic number of the Kneser hypergraph, proved topologically for every k.

---