Judicious Partitions of 3-uniform Hyperg
✍
B. Bollobás; A.D. Scott
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 113 KB
A conjecture of Bollobás and Thomason asserts that, for r ≥ 1, every r -uniform hypergraph with m edges can be partitioned into r classes such that every class meets at least rm/(2r -1) edges. Bollobás, Reed and Thomason [3] proved that there is a partition in which every edge meets at least (1 -1/e