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

Description

Abstract:
A k-uniform tight cycle is a k-graph (k-uniform hypergraph) with a cyclic order of its vertices such that every k consecutive vertices from an edge. We show that for k >= 3, every red-blue edge-coloured complete k-graph on n vertices contains k vertex-disjoint monochromatic tight cycles that together cover n - o(n) vertices. This talk is based on joint work with Allan Lo.

Period	26 Jan 2024
Held at	Institute of Discrete Mathematics (5050)