English

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 22-factorization of the complete multipartite graph Km×nK_{m\times n}. Here we focus our attention on 22-factorizations regular under the cyclic group ZmnZ_{mn}, whose 22-factors are disjoint union of cycles all of even length \ell. In particular, we present a complete solution for the extremal cases =4\ell=4 and =mn\ell=mn.

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

R2 v1 2026-06-22T13:15:22.404Z