On the chromatic number of the general Kneser-graph

Given integers k, n, 2 n0(k) the chromatic number of this graph is (k - 1)() + rs, where n = (k - 1)s + r, 0 ≤ r < k - 1.

[1]  Imre Bárány,et al.  A Short Proof of Kneser's Conjecture , 1978, J. Comb. Theory, Ser. A.

[2]  J. R. Tort.  Un probleme de partition de l'ensemble des parties a trois elements d'un ensemble fini , 1983, Discret. Math..

[3]  László Lovász,et al.  Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[4]  Peter Frankl,et al.  On intersecting families of finite sets , 1978, Bulletin of the Australian Mathematical Society.

[5]  B. Bollobás.  On complete subgraphs of different orders , 1976, Mathematical Proceedings of the Cambridge Philosophical Society.