Cyclic uniform 2-factorizations of the complete multipartite graph

DOI10.1007/S00373-018-1920-XzbMATH Open1402.05178OpenAlexW2963354208WikidataQ114229653 ScholiaQ114229653MaRDI QIDQ1756038FDOQ1756038

Authors Anita Pasotti, Marco Antonio Pellegrini

Publication date 11 January 2019

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.06469

zbMATH Keywords

cyclecomplete multipartite graph2-factorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Recommendations

• On the Oberwolfach problem for complete multigraphs
• The equipartite Oberwolfach problem with uniform tables
• On the Oberwolfach problem with two similar length cycles
• The solution of the bipartite analogue of the Oberwolfach problem
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem

Cites work

• scientific article; zbMATH DE number 1394637 (Why is no real title available?)
• A complete solution to the two-table Oberwolfach problems
• A generalization of the Oberwolfach problem
• Abelian 1-factorizations of the complete graph
• Bipartite 2-factorizations of complete multipartite graphs
• Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
• Nilpotent 1-factorizations of the complete graph
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• On a generalization of the Oberwolfach problem
• On sharply vertex transitive 2-factorizations of the complete graph
• On the Hamilton-Waterloo problem for bipartite 2-factors
• On the Oberwolfach problem for complete multigraphs
• Primitive 2-factorizations of the complete graph
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Sectionable terraces and the (generalised) Oberwolfach problem
• Symmetric 1-factorizations of the complete graph
• The equipartite Oberwolfach problem with uniform tables
• The solution of the bipartite analogue of the Oberwolfach problem

Cited in

(7)

• Cycles in 2-factors of balanced bipartite graphs
• A generalization of Heffter arrays
• The solution of the bipartite analogue of the Oberwolfach problem
• Cyclic cycle systems of the complete multipartite graph
• The equipartite Oberwolfach problem with uniform tables
• scientific article; zbMATH DE number 6928815 (Why is no real title available?)
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property

This page was built for publication: Cyclic uniform 2-factorizations of the complete multipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756038)