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
6 - Delta-matroids for graph theorists
Published online by Cambridge University Press: 17 June 2019
By
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
Summary
What happens if you try to develop matroid theory, but start with topological graph theory? This survey provides an introduction to delta-matroids. We aim to illustrate the two-way interaction between graph theory and delta-matroid theory that enriches both subjects. Along the way we shall seeintimate connections between delta-matroids and, amongst others, circle graphs, Eulerian circuits, embedded graphs, matchings, pivot-minors, (skew-)symmetric matrices, and vertex-minors.
Keywords
- Type
- Chapter
- Information
- Surveys in Combinatorics 2019 , pp. 167 - 220Publisher: Cambridge University PressPrint publication year: 2019
- 4
- Cited by