Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2309.04218 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910437466963968 |
|---|---|
| author | Lo, Allan Pfenninger, Vincent |
| author_facet | Lo, Allan Pfenninger, Vincent |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_04218 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles Lo, Allan Pfenninger, Vincent Combinatorics 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. |
| title | Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2309.04218 |