Trivial colors in colorings of Kneser graphs - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Trivial colors in colorings of Kneser graphs

Andrey Kupavskii

Résumé

We show that any proper coloring of a Kneser graph $KG_{n,k}$ with $n-2k+2$ colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), provided $n>(2+\epsilon)k^2$, where $\epsilon\to 0$ as $k\to \infty$. This bound is essentially tight.

Dates et versions

hal-03236551 , version 1 (26-05-2021)

Identifiants

Citer

Sergei Kiselev, Andrey Kupavskii. Trivial colors in colorings of Kneser graphs. 2021. ⟨hal-03236551⟩
17 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More