Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles Article Swipe
Related Concepts
Combinatorics
Monochromatic color
Wheel graph
Mathematics
Vertex (graph theory)
Graph
Complete graph
Discrete mathematics
Graph power
Physics
Line graph
Optics
Allan Lo
,
Vincent Pfenninger
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2309.04218
· OA: W4386614611
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2309.04218
· OA: W4386614611
A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 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.
Related Topics
Finding more related topics…