On the Hamilton–Waterloo Problem with Odd Orders
Journal of Combinatorial Designs · 2017-06 · 25 (6) · 258-287
DOI: 10.1002/jcd.21552 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 07.12.2016. Verfasst von A. C. Burgess und 2 weiteren Autor:innen. Die Arbeit wurde bisher 15-mal zitiert (Crossref) und nennt 50 Literaturangaben. Gefördert von: Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
Given nonnegative integers , the Hamilton–Waterloo problem asks for a factorization of the complete graph into α ‐factors and β ‐factors. Without loss of generality, we may assume that . Clearly, v odd, , , and are necessary conditions. To date results have only been found for specific values of m and n . In this paper, we show that for any integers , these necessary conditions are sufficient when v is a multiple of and , except possibly when or 3. For the case where we show sufficiency when with some possible exceptions. We also show that when are odd integers, the lexicographic product of with the empty graph of order n has a factorization into α ‐factors and β ‐factors for every , , with some possible exceptions.
Förderung
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Burgess, A. C., Danziger, P., & Traetta, T. (2017). On the Hamilton–Waterloo Problem with Odd Orders. Journal of Combinatorial Designs, 25(6), 258-287. https://doi.org/10.1002/jcd.21552
Vancouver
Burgess AC, Danziger P, Traetta T. On the Hamilton–Waterloo Problem with Odd Orders. Journal of Combinatorial Designs. 2017;25(6):258-287. doi:10.1002/jcd.21552
BibTeX
@article{Burgess2017,
author = {Burgess, A. C. and Danziger, P. and Traetta, T.},
title = {On the Hamilton–Waterloo Problem with Odd Orders},
journal = {Journal of Combinatorial Designs},
year = {2017},
volume = {25},
number = {6},
pages = {258--287},
doi = {10.1002/jcd.21552}
}
EUVIMED