Achromatic numbers of Kneser graphs

Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño, Christian Rubio-Montiel

Published 2020-03-20Version 1

Complete colorings have the property that any two color classes has at least an edge between them. Parameters such as the Grundy, achromatic and pseudoachromatic numbers comes 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)$.