School of Physical Sciences
                  ALGEBRA AND COMBINATORICS SEMINAR

                      Tue 18 Mar 2008 3pm 67-641


 Almost regular edge colourings and regular decompositions of complete graphs

                           Darryn Bryant

                     University of Queensland
 
Abstract
I will discuss a method for modifying any edge colouring of a complete graph 
so that the subgraph induced by each colour class is more regular. I will then 
show how the method can be used to give simple proofs of various results, some 
of which are known and some of which are new. 


All welcome.