Abstract
Bollobás and Scott showed that the vertices of a graph of m edges can be partitioned into k sets such that each set contains at most m/k2+o(m) edges. They conjectured that the vertices of an r-uniform hypergraph, where r≥3, of m edges may likewise be partitioned into k sets such that each set contains at most m/kr+o(m) edges. In this paper, we prove the weaker statement that a partition into k sets can be found in which each set contains at most m(k−1)r+r1/2(k−1)r/2+o(m) edges. Some partial results on this conjecture are also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
