Abstract

 
 
 We answer a question of Gyárfás and Sárközy from 2013 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 k-partite k-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.
 
 
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
