20 citations · 71 across the 33 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Chromatic thresholds in sparse random graphs
Peter Allen, Julia Böttcher, Simon Griffiths +2
The chromatic threshold of a graph with respect to the random graph is the infimum over such that the following holds with high probability: the fam…
math.CO2015
Chromatic thresholds in dense random graphs
Peter Allen, Julia Böttcher, Simon Griffiths +2
The chromatic threshold of a graph with respect to the random graph is the infimum over such that the following holds with high probability: the fam…
math.CO2015★ 1 cited
Triangle-free subgraphs of random graphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the str…