Abstract:
 The HamiltonWaterloo problem is a generalization of the
well known Oberwolfach problem, which asks for a 2factorization of
the complete graph $K_n$ in which $r$ of its 2factors are
isomorphic to a given 2factor $R$ and s of its 2factors are
isomorphic to a given 2factor $S$ with $2(r+s)=n1$. In this talk I will introduce our recent work on the HamiltonWaterloo problem when the given 2factors $R$ and $S$ are consisted of odd cycles.
