Almost partitioning every 2 -edge-coloured complete k -graph into k monochromatic tight cycles

Allan Lo, Vincent Pfenninger. Almost partitioning every 2 -edge-coloured complete k -graph into k monochromatic tight cycles. Innov. Graph Theory, 1:1-19, 2024. [doi]

Abstract

Abstract is missing.