Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles. Issue 1 (15th November 2018)

• Record Type: Journal Article
• Authors: Bustamante, Sebastián; Hàn, Hiêp; Stein, Maya
• Is Part Of: Journal of graph theory. Volume 91:Issue 1(2019)
• Page Start: 5
• Page End: 15
• Publication Date: 2018-11-15
• Subjects: hypergraph -- loose cycle -- monochromatic partitions -- tight cycle; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.22417
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: We show that for every η > 0 there exists an integer n 0 such that every 2 ‐coloring of the 3 ‐uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles of distinct colors that together cover all but at most η n vertices. The same result holds if tight cycles are replaced by loose cycles.