Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

József Balogh, Danila Cherkashin, Sergei Kiselev

Research output: Contribution to journalArticlepeer-review


We suggest a new method for coloring generalized Kneser graphs based on hypergraphs with high discrepancy and a small number of edges. The main result provides a proper coloring of K(n,n∕2−t,s) in (4+o(1))(s+t) 2 colors, which is produced by Hadamard matrices. Also, we show that for colorings by independent set of a natural type, this result is the best possible up to a multiplicative constant. Our method extends to Kneser hypergraphs as well.

Original languageEnglish (US)
Pages (from-to)228-236
Number of pages9
JournalEuropean Journal of Combinatorics
StatePublished - Jun 2019

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs'. Together they form a unique fingerprint.

Cite this