Book contents
- Frontmatter
- Contents
- Preface
- 1 Counting planar maps, coloured or uncoloured
- 2 A survey of PPAD-completeness for computing Nash equilibria
- 3 Hypergraph Turán problems
- 4 Some new results in extremal graph theory
- 5 The cyclic sieving phenomenon: a survey
- 6 Order in building theory
- 7 Graphs, colours, weights and hereditary properties
- 8 Random geometric graphs
- 9 Transversals in latin squares: a survey
Preface
Published online by Cambridge University Press: 05 August 2011
- Frontmatter
- Contents
- Preface
- 1 Counting planar maps, coloured or uncoloured
- 2 A survey of PPAD-completeness for computing Nash equilibria
- 3 Hypergraph Turán problems
- 4 Some new results in extremal graph theory
- 5 The cyclic sieving phenomenon: a survey
- 6 Order in building theory
- 7 Graphs, colours, weights and hereditary properties
- 8 Random geometric graphs
- 9 Transversals in latin squares: a survey
Summary
The Twenty-Third British Combinatorial Conference was organised by the University of Exeter. It was held in Exeter in July 2011. The British Combinatorial Committee had invited nine distinguished combinatorialists 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 I am indebted to the authors for preparing their articles so accurately and professionally, and to the referees for their rapid responses and keen eye for detail. I would also like to thank Roger Astley, Silvia Barbina and Clare Dennison at Cambridge University Press for their advice, assistance and patience. Finally, without the previous efforts of editors of earlier Surveys and the guidance of the British Combinatorial Committee, the preparation of this volume would have been quite impossible.
- Type
- Chapter
- Information
- Surveys in Combinatorics 2011 , pp. vii - viiiPublisher: Cambridge University PressPrint publication year: 2011