73 citations · 82 across the 14 of their papers we have counts for
1 paper · 1 filter
Neal Bushaw, Nathan Kettle
The Turán number of a graph H, ex(n;H), is the maximum number of edges in any graph on n vertices which does not contain H as a subgraph. Let P_l denote a path on l vertices, and k…