Partitioning infinite hypergraphs into few monochromatic Berge-paths
Bustamante, S., Corsten, J. & Frankl, N.
(2020).
Partitioning infinite hypergraphs into few monochromatic Berge-paths.
Graphs and Combinatorics,
36(3), 437 - 444.
https://doi.org/10.1007/s00373-019-02113-3
Extending a result of Rado to hypergraphs, we prove that for all s, k, t∈ N 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.
