Monochromatic paths in 2-edge-coloured graphs and hypergraphs (Q2699642)

Summary: We answer a question of \textit{A. Gyárfás} and \textit{G. N. Sárközy} [Electron. J. Comb. 20, No. 1, Research Paper P18, 8 p. (2013; Zbl 1266.05091)] by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of different colours. We also give a lower bound for the number of tight paths needed to partition any 2-edge-coloured complete \(r\)-partite \(r\)-uniform hypergraph. Finally, we show that any 2-edge coloured complete bipartite graph has a partition into a monochromatic cycle and a monochromatic path, of different colours, unless the colouring is a split colouring.