Abstract
Improving our earlier result we show that every large enough complete k-uniform r-colored hypergraph can be partitioned into at most 50rklog(rk) vertex disjoint monochromatic loose cycles. The proof uses a strong hypergraph Regularity Lemma due to Rödl and Schacht and the new, powerful hypergraph Blow-up Lemma of Keevash.
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.
