14 citations · 22 across the 11 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
Graphs with the Fewest Matchings
L. Keough, A. J. Radcliffe
In recent years there has been increased interest in extremal problems for "counting" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of…
math.CO2013★ 1 cited
The maximum number of complete subgraphs in a graph with given maximum degree
Jonathan Cutler, A. J. Radcliffe
Extremal problems involving the enumeration of graph substructures have a long history in graph theory. For example, the number of independent sets in a -regular graph on ve…