Table of Contents

1. Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgams L. D. Anderson and C. A. Rodger; 2. Combinatorial schemes for protecting digital content Simon R. Blackburn; 3. Matroids and Coxeter groups A. V. Borovik; 4. Algorithmic aspects of graph homomorphisms P. Hell; 5. Finite projective planes with a large Abelian group D. Ghinelli and D. Jungnickel; 6. Partition regular equations I. Leader; 7. Kostka-Foulkes polynomials and Macdonald spherical functions K. Nelsen and A. Ram; 8. Defining sets in combinatorics: a survey D. Donovan, E. S. Mahmoodian, C. Ramsay and A. P. Street; 9. Counting lattice triangulations V. Kaibel and G. Ziegler.