Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles

Sebastian Bustamante, Hiep Han, Maya Stein

We show that for every η > 0 there exists an integer n_0 such that every 2-colouring of the 3-uniform complete hypergraph on n \geq n_0 vertices contains two disjoint monochromatic…