English

The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors

Combinatorics 2015-04-22 v1

Abstract

Given 2-factors RR and SS of order nn, let rr and ss be nonnegative integers with r+s=n12r+s=\lfloor \frac{n-1}{2}\rfloor, the Hamilton-Waterloo problem asks for a 2-factorization of KnK_n if nn is odd, or of KnIK_n-I if nn is even, in which rr of its 2-factors are isomorphic to RR and the other ss 2-factors are isomorphic to SS. In this paper, we solve the problem for the case of triangle-factors and heptagon-factors for odd nn with 3 possible exceptions when n=21n=21.

Keywords

Cite

@article{arxiv.1504.05293,
  title  = {The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors},
  author = {Hongchuan Lei and Hung-Lin Fu},
  journal= {arXiv preprint arXiv:1504.05293},
  year   = {2015}
}

Comments

in Graphs and Combinatorics, 2015