Abstract
We show that any proper coloring of a Kneser graph with colors contains a trivial color (i.e., a color consisting of sets that all contain a fixed element), provided , where as . 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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.