著者紹介

内容

目次

1. Decompositions of complete graphs: embedding partial edge-colouringsand the method of amalgams L. D. Anderson and C. A. Rodger; 2. Combinatorialschemes for protecting digital content Simon R. Blackburn; 3. Matroids andCoxeter groups A. V. Borovik; 4. Algorithmic aspects of graph homomorphismsP. Hell; 5. Finite projective planes with a large Abelian group D. Ghinelliand 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.