Decomposition of bounded degree graphs into C4-free subgraphs

Abstract

We prove that every graph with maximum degree admits a partition of its edges into O() parts (as ∞) none of which contains C4 as a subgraph. This bound is sharp up to a constant factor. Our proof uses an iterated random colouring procedure.