WorksMathematics
Judicious -partitions of -uniform hypergraphs
Abstract
Bollobás and Thomason conjectured that every -uniform hypergraph with edges admits an -partition such that each class meets at least edges. In this paper, we establish a lower bound of for every . This improves Haslegrave's bound for every .