Abstract

We show that any proper coloring of a Kneser graph KGn,kKG_{n,k} with n−2k+2n-2k+2 colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), provided n>(2+ε)k2n>(2+\varepsilon)k^2, where ε→0\varepsilon\to 0 as k→∞k\to \infty. This bound is essentially tight. This is a consequence of a more general result on the minimum number of non-trivial colors needed to properly color KGn,kKG_{n,k}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.