Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
Combinatorics
2024-12-02 v1
Abstract
We investigate 1-factorisations in which the 2-regular graphs that occur as the union of a pair of 1-factors appear an equal number of times across the unions of all pairs of 1-factors in the 1-factorisation. We call such 1-factorisations balanced 1-factorisations (B1Fs) and we present some results on B1Fs of 3- and 4-regular circulant graphs.
Keywords
Cite
@article{arxiv.2411.19197,
title = {Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs},
author = {Jeremy Mitchell},
journal= {arXiv preprint arXiv:2411.19197},
year = {2024}
}
Comments
27 pages, 11 figures