Improved bounds and algorithms for hypergraph 2-coloring

Jaikumar Radhakrishnan, Aravind Srinivasan

Abstract: We show that for all large n, every n-uniform hypergraph with at most $0.7\sqrt{n/\ln{n}}\times2^n$ edges can be 2-colored. This makes progress on a problem of Erdös [Nordisk Mat. Tidskrift 11, 5–10 ...