Extremal theory of vertex or edge ordered graphs

DOI10.1017/9781108649094.008zbMath1476.05085OpenAlexW3093183532MaRDI QIDQ5149172

Gábor Tardos

Publication date: 6 February 2021

Published in: Surveys in Combinatorics 2019 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/9781108649094.008

zbMATH Keywords

extremal combinatoricsTurán theoremordered graphsconvex geometric graphsErdős-Stone-Simonovits theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (6)

Tilings in vertex ordered graphs ⋮ Dirac-type results for tilings and coverings in ordered graphs ⋮ Edge-ordered Ramsey numbers ⋮ On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ Saturation of Ordered Graphs ⋮ Monochromatic spanning trees and matchings in ordered complete graphs

This page was built for publication: Extremal theory of vertex or edge ordered graphs