14 citations · 22 across the 11 of their papers we have counts for
12 papers
Many cliques with few edges
Rachel Kirsch, A. J. Radcliffe
Recently Cutler and Radcliffe proved that the graph on vertices with maximum degree at most having the most cliques is a disjoint union of cliques…
Maximizing 2-Independent Sets in 3-Uniform Hypergraphs
Lauren Keough, A. J. Radcliffe
There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets i…
Supersaturation for subgraph counts
Jonathan Cutler, JD Nir, A. J. Radcliffe
The classic extremal problem is that of computing the maximum number of edges in an -free graph. In the case where , the extremal number was determined by Turán. Late…
Maximizing the density of 's in graphs of bounded degree and clique number
R. Kirsch, A. J. Radcliffe
Zykov showed in 1949 that among graphs on vertices with clique number , the Turán graph maximizes not only the number of edges but also the number of copie…
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 , among all graphs on vertice…
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…