14 citations · 14 across the 1 of their papers we have counts for
1 paper
Jonathan Cutler, JD Nir, A. J. Radcliffe
The classic extremal problem is that of computing the maximum number of edges in an F-free graph. In the case where F=Kr+1, the extremal number was determined by Turán. Late…