Relative Tur\'an densities of ordered graphs
Christian Reiher, Vojt\v{e}ch R\"odl, Marcelo Sales, Mathias Schacht
TL;DR
This paper introduces a modified version of the Turán density for ordered graphs and explores its properties, providing new insights into extremal graph theory for ordered structures.
Contribution
It proposes a novel modification of Turán density specifically for ordered graphs and studies its fundamental properties.
Findings
Defined a new graph parameter for ordered graphs
Analyzed basic properties and bounds of the modified Turán density
Provided initial results and potential applications in extremal combinatorics
Abstract
We introduce a modification of the Tur\'an density of ordered graphs and investigate this graph parameter.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.