2 papers
math.CO2025
Embedding trees using minimum and maximum degree conditions
Alexey Pokrovskiy, Leo Versteegen, Ella Williams
A variant of the ErdÅs-Sós conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least and maximum degree at lea…
math.CO2025
Relative Turán densities for ordered graphs: all and nothing
Freddie Illingworth, Arjun Ranganathan, Leo Versteegen +1
Reiher, Rödl, Sales, and Schacht initiated the study of relative Turán densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For…