Seminario de Grafos

Partitioning complete hypergraphs into few monochromatic Berge-cycles

Event Date: May 10, 2018 in Seminario de Grafos, Seminars

Extending a result of Rado to hypergraphs, we prove that for all r,k with k≥2, the vertices of every r(k-1)-edge-coloured countably infinite complete graph can be core-partitioned into at most r monochromatic Berge-cycles of different colours. We further describe a construction showing that this result is best possible. This is a joint work with Jan Corsten and Nóra Frankl.