2020/02/06 by Hunter Spink, Marius Tiba
paper · doi:10.1002/rsa.20908
Bollobás, Reed, and Thomason proved every 3‐uniform hypergraph ℋ with m edges has a vertex‐partition V ()= V 1 ⊔ V 2 ⊔ V 3 such that each part meets at least edges, later improved to 0.6 m by Halsegrave and improved asymptotically to 0.65 m + o ( m ) by Ma and Yu. We improve this asymptotic bound to , which is best possible up to the error term, resolving a special case of a conjecture of Bollobás and Scott.