Partitioning complete hypergraphs into few monochromatic Berge-cycles

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.

Date: May 10, 2018 at 10:15 h
Venue: Beauchef 851, Torre Norte, Piso 7. Sala de Seminario John Von Neumann
Speaker: Sebastián Bustamante
Affiliation: CMM-U. de Chile
Coordinator: Prof. Maya Stein

Posted on May 9, 2018 in Seminario de Grafos, Seminars