DOI

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.

Язык оригиналаанглийский
Страницы (с-по)228-236
Число страниц9
ЖурналEuropean Journal of Combinatorics
Том79
DOI
СостояниеОпубликовано - 1 июн 2019

    Предметные области Scopus

  • Дискретная математика и комбинаторика

ID: 41133039