Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus Random Struct Alg. 2020; 57: 47– 63. https://doi.org/10.1002/rsa.20915
In Edge decompositions of graphs with high minimum degree, Daniela Kühn, Allan Lo, Deryk Osthus and I proved that the edge sets of sufficiently dense graphs satisfying necessary divisibility conditions could be partitioned into copies of an arbitrary graph . This result has since been generalised to other settings by various authors. In this paper we present a simplified account of the latest version of the argument, specialised to the case where is a triangle.