Cyclic uniform 2-factorizations of the complete multipartite graph

Abstract

The generalization of the Oberwolfach Problem, proposed by J. Liu in 2000, asks for a uniform 2-factorization of the complete multipartite graph Km× n. Here we focus our attention on 2-factorizations regular under the cyclic group Zmn, whose 2-factors are disjoint union of cycles all of even length . In particular, we present a complete solution for the extremal cases =4 and =mn.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…