scientific article; zbMATH DE number 3950583
[For the entire collection see Zbl 0563.00004.] For p an even integer, let \(H_ p\) be the complete graph of order p with the edges of a 1-factor deleted and, for p odd, let \(H_ p\) be the complete graph of order p. The Oberwolfach problem is to determine whether, for any given 2-factor G of \(H_ p\), where p is odd, it is possible to decompose \(H_ p\) into 2-factors, each of which is isomorphic to G. The corresponding problem when p is even is called the spouse-avoiding Oberwolfach problem. The authors investigate the special case where \(p=mn\) and G consists of n cycles of length m. The authors show that such a decomposition is possible whenever (a) \(n=4\) and m is even, or (b) n is even and m is a multiple of 4, or (c) n is a multiple of 3 other than 6 and 12. This last result relies on the existence of Kirkman triple systems and nearly Kirkman triple systems and the following result proved in this paper. The complete tripartite graph K(n,n,n) can be decomposed into m 2-factors, where each 2-factor consists of 3 cycles of length m.
- \(C_ k\)-factorization of complete bipartite graphs
- \(G\)-designs and related designs
- Factorizations of product graphs into cycles of uniform length
- The Oberwolfach problem and factors of uniform odd length cycles
- Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Cycle frames of complete multipartite multigraphs. III
- Some observations on the oberwolfach problem
- A generalization of the Oberwolfach problem
- On the spouse-loving variant of the Oberwolfach problem
- scientific article; zbMATH DE number 7593862 (Why is no real title available?)
- Almost resolvable even cycle decompositions of ( K_u K_g)()
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720643)