No label defined (Q3720643)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3950583
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3950583

      Statements

      0 references
      0 references
      0 references
      0 references
      1985
      0 references
      complete graph
      0 references
      2-factor
      0 references
      spouse-avoiding Oberwolfach problem
      0 references
      cycles
      0 references
      Kirkman triple systems
      0 references
      complete tripartite graph
      0 references
      [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.
      0 references

      Identifiers