S. Kiselev

activity

20182021

k

-partite hypergraphs

8 citations · 9 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

Sharp bounds for the chromatic number of random Kneser graphs

Sergei Kiselev, Andrey Kupavskii

Given positive integers $n \geq 2 k$ , the {\it Kneser graph} $K G_{n, k}$ is a graph whose vertex set is the collection of all $k$ -element subsets of the set ${1, \dots, n}$ , with edg…

math.CO2018

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

Jozsef Balogh, Danila Cherkashin, Sergei Kiselev

We suggest a new method on coloring generalized Kneser graphs based on hypergraphs with high discrepancy and small number of edges. The main result is providing a proper coloring o…