76 citations · 568 across the 46 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013★ 64 cited
On the KŁR conjecture in random graphs
D. Conlon, W. T. Gowers, W. Samotij +1
The KŁR conjecture of Kohayakawa, Łuczak, and Rödl is a statement that allows one to prove that asymptotically almost surely all subgraphs of the random graph G_{n,p}, for sufficie…
math.CO2013★ 27 cited
Extremal results in random graphs
Vojtěch Rödl, Mathias Schacht
According to Paul Erdős [Some notes on Turán's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Turán who "created the area of extremal problems in graph theory"…