14 citations · 22 across the 11 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
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…
math.CO2019
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…
math.CO2019★ 14 cited
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…