Return to Article Details Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
Download