27 citations · 137 across the 40 of their papers we have counts for
4 papers · 1 filter
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family
Jie Han, Yoshiharu Kohayakawa
The celebrated Erdős-Ko-Rado theorem determines the maximum size of a -uniform intersecting family. The Hilton-Milner theorem determines the maximum size of a -uniform inters…
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…
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…
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…