Vertex‐regular 1‐factorizations in infinite graphs

DOI10.1002/JCD.21829MaRDI QIDQ6146192zbMATH OpenOpenAlexWikidataFDO

Authors Simone Costa, Tommaso Traetta

Publication date 5 February 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.09468

zbMATH Keywords

infinite Cayley graphregular 1-factorizationsubfactorization

Mathematics Subject Classification ID

Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: 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.

Recommendations

• Vertex-regular 1-factorizations of the complete graph
• One-factorizations of complete graphs with vertex-regular automorphism groups
• Symmetric 1-factorizations of the complete graph
• Cyclic and dihedral 1-factorizations of multipartite graphs
• Sharply transitive 1-factorizations of complete multipartite graphs

Cites work

• Abelian 1-factorizations in infinite graphs
• Abelian 1-factorizations of the complete graph
• Cyclic one-factorization of the complete graph
• Frattini-based starters in 2-groups
• scientific article; zbMATH DE number 3346654 (Why is no real title available?)
• Nilpotent 1-factorizations of the complete graph
• On a Class of Fixed-Point-Free Graphs
• One-factorizations of complete graphs with vertex-regular automorphism groups
• Quaternionic starters
• Sharply transitive 1‐factorizations of the complete graph with an invariant 1‐factor
• Starters: doubling constructions
• Symmetric 1-factorizations of the complete graph

This page was built for publication: Vertex‐regular 1‐factorizations in infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146192)