Cyclic uniform 2-factorizations of the complete multipartite graph
Combinatorics
2016-03-22 v1
Abstract
The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform -factorization of the complete multipartite graph . Here we focus our attention on -factorizations regular under the cyclic group , whose -factors are disjoint union of cycles all of even length . In particular, we present a complete solution for the extremal cases and .
Cite
@article{arxiv.1603.06469,
title = {Cyclic uniform 2-factorizations of the complete multipartite graph},
author = {Anita Pasotti and Marco Antonio Pellegrini},
journal= {arXiv preprint arXiv:1603.06469},
year = {2016}
}
Comments
24 pages