English

Vertex-regular $1$-factorizations in infinite graphs

Combinatorics 2021-06-18 v1

Abstract

The existence of 11-factorizations of an infinite complete equipartite graph Km[n]K_m[n] (with mm parts of size nn) admitting a vertex-regular automorphism group GG is known only when n=1n=1 and mm is countable (that is, for countable complete graphs) and, in addition, GG is a finitely generated abelian group GG of order mm. In this paper, we show that a vertex-regular 11-factorization of Km[n]K_m[n] under the group GG exists if and only if GG has a subgroup HH of order nn whose index in GG is mm. Furthermore, we provide a sufficient condition for an infinite Cayley graph to have a regular 11-factorization. Finally, we construct 1-factorizations that contain a given subfactorization, both having a vertex-regular automorphism group.

Keywords

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}
}
R2 v1 2026-06-24T03:18:47.404Z