Achromatic numbers of Kneser graphs
Combinatorics
2022-01-21 v2
Abstract
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 for some values of and . We give the exact value of the achromatic number of .
Cite
@article{arxiv.2003.09409,
title = {Achromatic numbers of Kneser graphs},
author = {Gabriela Araujo-Pardo and Juan Carlos Díaz-Patiño and Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:2003.09409},
year = {2022}
}
Comments
15 pages, 8 figures