A. J. Radcliffe

activity

20122019

most citedSupersaturation for subgraph counts

14 citations · 22 across the 11 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

math.CO2017★ 1 cited

Maximizing the density of $K_{t}$ 's in graphs of bounded degree and clique number

R. Kirsch, A. J. Radcliffe

Zykov showed in 1949 that among graphs on $n$ vertices with clique number $ω (G) \leq ω$ , the Turán graph $T_{ω} (n)$ maximizes not only the number of edges but also the number of copie…

math.CO2017

Extremal Threshold Graphs for Matchings and Independent Sets

L. Keough, A. J. Radcliffe

Many extremal problems for graphs have threshold graphs as their extremal examples. For instance the current authors proved that for fixed $k \geq 1$ , among all graphs on $n$ vertice…

math.CO2017

Many Triangles with Few Edges

R. Kirsch, A. J. Radcliffe

Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs w…

Maximizing the density of Kt​'s in graphs of bounded degree and clique number

Extremal Threshold Graphs for Matchings and Independent Sets

Many Triangles with Few Edges

Maximizing the density of $K_{t}$ 's in graphs of bounded degree and clique number