arXiv Analytics

Sign in

arXiv:2106.09468 [math.CO]AbstractReferencesReviewsResources

Vertex-regular $1$-factorizations in infinite graphs

Simone Costa, Tommaso Traetta

Published 2021-06-17Version 1

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

Related articles: Most relevant | Search more
arXiv:1512.02911 [math.CO] (Published 2015-12-09)
The colouring number of infinite graphs
arXiv:1508.05378 [math.CO] (Published 2015-08-21)
A Note On Immersion Intertwines Of Infinite Graphs
arXiv:2001.08596 [math.CO] (Published 2020-01-23)
Spectra of infinite graphs: two methods of computation