Book contents
- Frontmatter
- Contents
- Preface
- W.T. Tutte, 1917–2002
- 1 Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations
- 2 Combinatorial schemes for protecting digital content
- 3 Matroids and Coxeter groups
- 4 Defining sets in combinatorics: a survey
- 5 Finite projective planes with a large abelian group
- 6 Algorithmic aspects of graph homomorphisms
- 7 Counting lattice triangulations
- 8 Partition regular equations
- 9 Kostka–Foulkes polynomials and Macdonald spherical functions
1 - Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations
Published online by Cambridge University Press: 05 May 2013
Edited by
Book contents
- Frontmatter
- Contents
- Preface
- W.T. Tutte, 1917–2002
- 1 Decompositions of complete graphs: embedding partial edge-colourings and the method of amalgamations
- 2 Combinatorial schemes for protecting digital content
- 3 Matroids and Coxeter groups
- 4 Defining sets in combinatorics: a survey
- 5 Finite projective planes with a large abelian group
- 6 Algorithmic aspects of graph homomorphisms
- 7 Counting lattice triangulations
- 8 Partition regular equations
- 9 Kostka–Foulkes polynomials and Macdonald spherical functions
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Surveys in Combinatorics 2003 , pp. 7 - 42Publisher: Cambridge University PressPrint publication year: 2003
- 1
- Cited by