Monochromatic paths in 2-edge coloured graphs and hypergraphs

DOI10.37236/11465MaRDI QIDQ6397529arXivFDO

Authors Maya Stein

Publication date 26 April 2022

Published in arXiv

Full work available at URL https://doi.org/10.37236/11465

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10)

arXiv classification

math.CO

Abstract: We answer a question of Gy'arf'as and S'ark"ozy 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 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.

This page was built for publication: Monochromatic paths in $2$-edge coloured graphs and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397529)