Relative Tur\'an densities for ordered graphs: all and nothing
Abstract
Reiher, R\"odl, Sales, and Schacht initiated the study of relative Tur\'an densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For an ordered graph F, its relative Tur\'an density, <(F), is the greatest α such that every ordered graph G has an F-free subgraph with at least α e(G) edges. This paper contains two main results about relative Tur\'an densities. First, we find a family of host graphs that is optimal for all F. Second, we characterise the ordered graphs with zero relative Tur\'an density: precisely those with no monotone path of length two.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.