View of Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles | European Conference on Combinatorics, Graph Theory and Applications