On the chromatic number of the general Kneser-graph |
| |
Authors: | P Frankl |
| |
Abstract: | Given integers k, n, 2 < k < n, let us define a graph with vertex set V = {F ?{1, 2, …, n}: ∩F = k}, and (F, F') is an edge if |F ∩ F′| ≤ 1. We show that for n > n0(k) the chromatic number of this graph is (k - 1)() + rs, where n = (k - 1)s + r, 0 ≤ r < k - 1. |
| |
Keywords: | |
|
|