English

1-Factorizations of Cayley graphs

Combinatorics 2007-05-23 v1 Group Theory

Abstract

In this note we prove that all connected Cayley graphs of every finite group Q×HQ \times H are 1-factorizable, where QQ is any non-trivial group of 2-power order and HH is any group of odd order.

Keywords

Cite

@article{arxiv.0705.0193,
  title  = {1-Factorizations of Cayley graphs},
  author = {Alireza Abdollahi},
  journal= {arXiv preprint arXiv:0705.0193},
  year   = {2007}
}
R2 v1 2026-06-21T08:24:03.127Z