On graph decompositions modulo k

We prove that, for every integer k ⩾ 2, every graph has an edge-partition into 5k2 log k sets, each of which is the edge-set of a graph with all degrees congruent to 1 modk. This answers a question of Pyber.