Improved bounds and algorithms for hypergraph 2-coloring
Random Structures & Algorithms
Streaming algorithms for 2-coloring uniform hypergraphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Random coloring method in the combinatorial problem of Erdős and Lovász
Random Structures & Algorithms
| Hi-index | 0.00 |
Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k ≥ 2n, then m(r, k) ≥ ∈(k)kr(r/ln r)n/(n+1).