Packing closed trails into dense graphs

It has been shown (Combin. Probab. Comput. 10 (2001) 463–499) that if n is odd and m1,…,mt are integers with mi⩾3 and ∑i=1t mi=|E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1,…,mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.