The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs
β Scribed by Brett Stevens
- Book ID
- 104325647
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 316 KB
- Volume
- 297
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
We pose and completely solve the existence of pancyclic 2-factorizations of complete graphs and complete bipartite graphs. Such 2-factorizations exist for all such graphs, except a few small cases which we have proved are impossible. The solution method is simple but powerful. The pancyclic problem is intended to showcase the power this method o ers to solve a wide range of 2-factorization problems. Indeed, these methods go a long way towards being able to produce arbitrary 2-factorizations with one or two cycles per factor.
π SIMILAR VOLUMES
## Abstract We consider __k__βfactorizations of the complete graph that are 1β__rotational__ under an assigned group __G__, namely that admit __G__ as an automorphism group acting sharply transitively on all but one vertex. After proving that the __k__βfactors of such a factorization are pairwise i
## Abstract It is known that a necessary condition for the existence of a 1βrotational 2βfactorization of the complete graph __K__~2__n__+1~ under the action of a group __G__ of order 2__n__ is that the involutions of __G__ are pairwise conjugate. Is this condition also sufficient? The complete ans
## Abstract We consider 2βfactorizations of complete graphs that possess an automorphism group fixing __k__β©Ύ0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d