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