Abelian 1-factorizations of complete multipartite graphs
classification
🧮 math.CO
keywords
completegraphabelianfactorizationfactorsgroupmultipartitetimes
read the original abstract
An automorphism group G of a 1-factorization of the complete multipartite graph $K_{m\times n}$ consists in permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence or non-existence problem of a 1-factorization of $K_{m\times n}$ admitting an abelian group acting sharply transitively on the vertices of the graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.