15 citations · 17 across the 3 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
A spanning bandwidth theorem in random graphs
Peter Allen, Julia Böttcher, Julia Ehrenmüller +2
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any -vertex graph with minimum degree contains all -vertex -co…
math.CO2019
The anti-Ramsey threshold of complete graphs
Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Olaf Parczyk +1
For graphs and , let $G {\displaystyle\smash{\begin{subarray}{c} \hbox{$\tiny\rm rb$} \\ \longrightarrow \\ \hbox{$\tiny\rm p$} \end{subarray}}}H$ denote the property that f…