Peter Dukes

An F-decomposition of a graph G is a set of subgraphs of G, each isomorphic to F, whose edge sets partition the edge set of G. I will speak about a result showing that, for each odd k ≥ 5, any graph G of sufficiently large order n with minimum degree...