Answers are grounded in this paper and cite their sources.
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-√13)m/18 for every r≥ 2. This improves Haslegrave's bound $rm/(3r-4)$ for every r≥ 8.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: