Artículo de revista
Partitioning infinite hypergraphs into few monochromatic berge-paths
Fecha
2020Registro en:
Graphs and Combinatorics (2020) 36:437–444
10.1007/s00373-019-02113-3
Autor
Bustamante, Sebastián
Corsten, Jan
Frankl, Nóra
Institución
Resumen
Extending a result of Rado to hypergraphs, we prove that for all s,k,t is an element of N$$s, k, t \in {\mathbb {N}}$$\end{document} with k >= t >= 2 the vertices of every r=s(k-t+1)-edge-coloured countably infinite complete k-graph can be partitioned into the cores of at most s monochromatic t-tight Berge-paths of different colours. We further describe a construction showing that this result is best possible.