Judicious partitions of 3-uniform hypergraphs

John Haslegrave

The vertices of any graph with $m$ edges can be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollobás and Thomason conjectured that the vertice…