Random hypergraphs and property B

Lech Duraj, Jakub Kozik, Dmitry Shabanov

In 1964 Erdős proved that $(1+\oh{1})) \frac{\eul \ln(2)}{4} k^2 2^{k}$ edges are sufficient to build a $k$-graph which is not two colorable. To this day, it is not known whether t…