Book contents
- Frontmatter
- Contents
- Preface
- 1 Hereditary and monotone properties of combinatorial structures
- 2 Ordering classes of matrices of 0's and 1's
- 3 Cycle decompositions of complete graphs
- 4 Excluding induced subgraphs
- 5 Designs and topology
- 6 The number of points on an algebraic curve over a finite field
- 7 On the efficient approximability of constraint satisfaction problems
- 8 The combinatorics of cryptographic key establishment
- 9 Bandwidth of graphic matroids
Preface
Published online by Cambridge University Press: 16 March 2010
- Frontmatter
- Contents
- Preface
- 1 Hereditary and monotone properties of combinatorial structures
- 2 Ordering classes of matrices of 0's and 1's
- 3 Cycle decompositions of complete graphs
- 4 Excluding induced subgraphs
- 5 Designs and topology
- 6 The number of points on an algebraic curve over a finite field
- 7 On the efficient approximability of constraint satisfaction problems
- 8 The combinatorics of cryptographic key establishment
- 9 Bandwidth of graphic matroids
Summary
The Twenty-first Biennial British Combinatorial Conference was held at Reading in July 2007. The British Combinatorial Committee had invited ten distinguished combinatorial mathematicians to give survey lectures in areas of their expertise, and this volume contains the survey articles on which these lectures were based.
In compiling this volume we are indebted to the authors for preparing their articles so accurately and in such a timely manner and to the referees for their attention to detail while commenting on the articles. We would also like to thank Roger Astley at Cambridge University Press for his advice and help.
The British Combinatorial Committee gratefully acknowledges the financial support provided by the London Mathematical Society, the Institue for Combinatorics and its Applications, and the EPSRC.
- Type
- Chapter
- Information
- Surveys in Combinatorics 2007 , pp. vii - viiiPublisher: Cambridge University PressPrint publication year: 2007