63 citations · 210 across the 40 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 1 cited
On "stability" in the Erdős-Ko-Rado theorem
Pat Devlin, Jeff Kahn
Denote by the random subgraph of the usual Kneser graph in which edges appear independently, each with probability . Answering a question of Bollobás, Naraya…
math.PR2015★ 9 cited
Turán's Theorem for random graphs
Bobby DeMarco, Jeff Kahn
For a graph , denote by (resp. ) the maximum size of a -free (resp. -partite) subgraph of . Of course for any , and Turán…