On equitably 2-colourable odd cycle decompositions
Combinatorics
2024-02-02 v2
Abstract
An -cycle decomposition of is said to be \emph{equitably -colourable} if there is a -vertex-colouring of such that each colour is represented (approximately) an equal number of times on each cycle: more precisely, we ask that in each cycle of the decomposition, each colour appears on or of the vertices of . In this paper we study the existence of equitably 2-colourable -cycle decompositions of , where is odd, and prove the existence of such a decomposition for (mod ).
Cite
@article{arxiv.2309.15628,
title = {On equitably 2-colourable odd cycle decompositions},
author = {Andrea Burgess and Francesca Merola},
journal= {arXiv preprint arXiv:2309.15628},
year = {2024}
}
Comments
24pp