We prove that in every cyclic cycle-decomposition of $K_{2n} − I$ (the cocktail party graph of order 2n) the number of cycle-orbits of odd length must have the same parity of n(n − 1)/2. This gives, as corollaries, some useful non-existence results one of which allows to determine when the two table Oberwolfach Problem OP(3,2l) admits a 1-rotational solution.
A non-existence result on cyclic cycle decompositions of the cocktail party graph
BURATTI, Marco;
2009
Abstract
We prove that in every cyclic cycle-decomposition of $K_{2n} − I$ (the cocktail party graph of order 2n) the number of cycle-orbits of odd length must have the same parity of n(n − 1)/2. This gives, as corollaries, some useful non-existence results one of which allows to determine when the two table Oberwolfach Problem OP(3,2l) admits a 1-rotational solution.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
