Minimalist designs

Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus

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 F.  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 F is a triangle.

Leave a Reply

Your email address will not be published.