Vertex-regular $1$-factorizations in infinite graphs
Combinatorics
2021-06-18 v1
Abstract
The existence of -factorizations of an infinite complete equipartite graph (with parts of size ) admitting a vertex-regular automorphism group is known only when and is countable (that is, for countable complete graphs) and, in addition, is a finitely generated abelian group of order . In this paper, we show that a vertex-regular -factorization of under the group exists if and only if has a subgroup of order whose index in is . Furthermore, we provide a sufficient condition for an infinite Cayley graph to have a regular -factorization. Finally, we construct 1-factorizations that contain a given subfactorization, both having a vertex-regular automorphism group.
Cite
@article{arxiv.2106.09468,
title = {Vertex-regular $1$-factorizations in infinite graphs},
author = {Simone Costa and Tommaso Traetta},
journal= {arXiv preprint arXiv:2106.09468},
year = {2021}
}