3 citations · 7 across the 34 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
A note on random greedy coloring of uniform hypergraphs
Danila D. Cherkashin, Jakub Kozik
The smallest number of edges forming an n-uniform hypergraph which is not r-colorable is denoted by m(n,r). Erdős and Lovász conjectured that m(n,2)=θ(n 2^n)$. The best known lower…
math.CO2013
A new randomized algorithm for the Erdos--Hajnal problem
Danila Cherkashin
In 1961 Erdős and Hajnal introduced the quantity as the minimum number of edges in an -uniform hypergraph with chromatic number at least 3. The best known lower and upper…