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
7 - Extremal theory of vertex or edge ordered graphs
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
We enrich the structure of finite simple graphs with a linear order on either the vertices or the edges. Extending the standard question of Turan-type extremal graph theory we ask for the maximal number of edges in such a vertex or edge ordered graph on n vertices that does not contain a given pattern (or several patterns) as a subgraph. The forbidden subgraph itself is also a vertex or edge ordered graph, so we forbid a certain subgraph with a specified ordering, but we allow the same underlying subgraph with a different (vertex or edge) order. This allows us to study a large number of extremal problems that are not expressible in the classical theory. In this survey we report ongoing research. For easier access, we include sketches of proofs of selected results.
Keywords
- Type
- Chapter
- Information
- Surveys in Combinatorics 2019 , pp. 221 - 236Publisher: Cambridge University PressPrint publication year: 2019
- 4
- Cited by