Book contents
- Frontmatter
- Preface
- Contents
- 1 Clique-width for hereditary graph classes
- 2 Analytic representations of large graphs
- 3 Topological connectedness and independent sets in graphs
- 4 Expanders – how to find them, and what to find in them
- 5 Supersingular isogeny graphs in cryptography
- 6 Delta-matroids for graph theorists
- 7 Extremal theory of vertex or edge ordered graphs
- 8 Some combinatorial and geometric constructions of spherical buildings
Preface
Published online by Cambridge University Press: 17 June 2019
- Frontmatter
- Preface
- Contents
- 1 Clique-width for hereditary graph classes
- 2 Analytic representations of large graphs
- 3 Topological connectedness and independent sets in graphs
- 4 Expanders – how to find them, and what to find in them
- 5 Supersingular isogeny graphs in cryptography
- 6 Delta-matroids for graph theorists
- 7 Extremal theory of vertex or edge ordered graphs
- 8 Some combinatorial and geometric constructions of spherical buildings
Summary

- Type
- Chapter
- Information
- Surveys in Combinatorics 2019 , pp. vii - viiiPublisher: Cambridge University PressPrint publication year: 2019