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
6 - Order in building theory
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
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781139004114/resource/name/firstPage-9781139004114c6_p235-332_CBO.jpg)
- Type
- Chapter
- Information
- Surveys in Combinatorics 2011 , pp. 235 - 332Publisher: Cambridge University PressPrint publication year: 2011