5 papers
On Relative Ordered Turán Density
Dylan King, Bernard Lidický, Minghui Ouyang +3
For an ordered graph , denote the Turán density by . The relative Turán density, denoted by , is the supremum over such that every ordered graph …
On possible uniform Turán densities
Dylan King, Simón Piga, Marcelo Sales +1
Given a family of -graphs , the uniform Turán density is defined as the infimum for which any sufficiently large uniformly…
Rainbow Erdős-Sós Conjectures
Nicholas Crawford, Dylan King, Sam Spiro
An edge colored graph is said to contain rainbow- if is a subgraph and every edge receives a different color. In 2007, Keevash, Mubayi, Sudakov, and Verstraëte introduced th…
Lagrangians are attained as uniform Turán densities
Dylan King, Marcelo Sales, Bjarne Schülke
The study of uniform Turán densities was initiated in the 1980s by Erdős and Sós. Given a -graph , the uniform Turán density of , , is defined as the in…
Online Ramsey numbers of ordered graphs
Emily Heath, Dylan King, Grace McCourt +2
The online ordered Ramsey game is played between two players, Builder and Painter, on an infinite sequence of vertices with ordered graphs , which have linear orderings…