DEPARTMENT OF MATHEMATICS
       ALGEBRA AND COMBINATORICS SEMINAR

      1PM THURSDAY 18 MARCH 2004 in 43-102


     Cube factorisations of complete graphs

               Barbara Maenhaut
          Department of Mathematics,
           University of Queensland


Abstract
A d-cube factor of the complete graph on n vertices,  K_n,  is a
spanning subgraph of  K_n  in which each component is a d-cube. 
A  d-cube factorisation of K_n is a partitioning of the edge set of K_n
into d-cube factors. A  d-cube decomposition of K_n is a partitioning
of the edge set of K_n into  d-cubes. This talk will commence with a
brief survey about  d-cube decompositions and  d-cube factorisations.
The remainder of the talk will be devoted to constructing a 3-cube
factorisation of  K_n  for all n\equiv 16 (mod 24).  This
result is joint work with Peter Adams and Darryn Bryant.


All welcome.


-------------------
Pete Jenkins
pdj@maths.uq.edu.au