Achromatic numbers of Kneser graphs

Abstract

Complete vertex colorings have the property that any two color classes have at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers come from complete colorings, with some additional requirement. In this paper, we estimate these numbers in the Kneser graph K(n, k) for some values of n and k. We give the exact value of the achromatic number of K(n, 2).