4 papers · 1 filter
Improving in just two bites
Zion Hefty, Paul Horn, Dylan King +1
We present a flexible random construction which, for certain graphs , is able to produce -free graphs with edge density strictly larger than that of the -free process, whi…
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…