British Combinatorial Conference 2007
The conference webpage has lots of details. Please follow the links.

Also, Darren Bryant will be one of the speakers. His talk will be entitled: Cycle decompositions of complete graphs.

Abstract:
The problem of decomposing complete graphs into cycles of specified lengths dates back to the mid-nineteenth century when Kirkman solved the case where all the cycles have length three. The case where all of the cycles are of an arbitrary uniform length wasn't completely solved until just over one hundred and fifty years later. The general problem where the specified cycle lengths vary remains unsolved. We decomposition techniques that have been developed.

Conference Homepage
The British Combinatorial Committee Homepage

Any enquiries should be addressed to A.J.W.Hilton@reading.ac.uk.

AJW Hilton
October 2006