7 citations · 26 across the 20 of their papers we have counts for
4 papers · 1 filter
On the Hamilton-Waterloo Problem with odd orders
A. Burgess, P. Danziger, T. Traetta
Given non-negative integers , the Hamilton-Waterloo problem asks for a factorization of the complete graph into -factors and -factors. Clearl…
On the existence of unparalleled even cycle systems
Peter Danziger, Eric Mendelsohn, Tommaso Traetta
A -cycle system of order is a set of cycles whose edges partition the edge-set of (i.e., the complete graph minus the -factor ). If $v\equiv 0 \…
On the full automorphism group of a Hamiltonian cycle system of odd order
Marco Buratti, Graham J. Lovegrove, Tommaso Traetta
It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or th…
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
Francesca Merola, Tommaso Traetta
It is conjectured that for every pair of odd integers greater than 2 with , there exists a cyclic two-factorization of having exac…