arXiv Analytics

Sign in

arXiv:1210.1078 [math.CO]AbstractReferencesReviewsResources

Abelian 1-factorizations of complete multipartite graphs

Mathieu Bogaerts

Published 2012-10-03Version 1

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.

Related articles: Most relevant | Search more
arXiv:1301.4583 [math.CO] (Published 2013-01-19)
Distinguishing partitions of complete multipartite graphs
arXiv:1406.4958 [math.CO] (Published 2014-06-19)
The automorphism group of a graphon
arXiv:0711.4670 [math.CO] (Published 2007-11-29, updated 2008-11-25)
Automorphism groups of root systems matroids