no. 13 · Wednesday 11 November 2026
Judicious $r$-partitions of $r$-uniform hypergraphs
Abstract
Bollobás and Thomason conjectured that every $r$-uniform hypergraph with $m$ edges admits an $r$-partition such that each class meets at least $rm/(2r-1)$ edges. In this paper, we establish a lower bound of $(11-\sqrt{13})m/18$ for every $r\ge 2$. This improves Haslegrave's bound $rm/(3r-4)$ for every $r\ge 8$.
- fields
- Combinatorics