Projects per year
Abstract
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 ≥ 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.
Original language | English |
---|---|
Title of host publication | EUROCOMB’23 |
Publisher | Masaryk University Press |
Pages | 1-6 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 28 Aug 2023 |
Event | European Conference on Combinatorics, Graph Theory and Applications - Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic Duration: 28 Aug 2023 → 1 Sept 2023 https://iuuk.mff.cuni.cz/events/conferences/eurocomb23/ |
Publication series
Name | European Conference on Combinatorics, Graph Theory and Applications |
---|---|
Publisher | Masaryk University Press |
Number | 12 |
ISSN (Electronic) | 2788-3116 |
Conference
Conference | European Conference on Combinatorics, Graph Theory and Applications |
---|---|
Abbreviated title | EUROCOMB'23 |
Country/Territory | Czech Republic |
City | Prague |
Period | 28/08/23 → 1/09/23 |
Internet address |
Fingerprint
Dive into the research topics of 'Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles'. Together they form a unique fingerprint.Projects
- 2 Finished
-
Ramsey theory: an extremal perspective
Treglown, A. (Co-Investigator) & Lo, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/01/22 → 31/12/24
Project: Research Councils
-
Matchings and tilings in graphs
Lo, A. (Co-Investigator) & Treglown, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/03/21 → 29/02/24
Project: Research Councils