2 papers
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 , among all graphs on vertice…
math.CO2015
Counting dominating sets and related structures in graphs
Jonathan Cutler, A. J. Radcliffe
We consider some problems concerning the maximum number of (strong) dominating sets in a regular graph, and their weighted analogues. Our primary tool is Shearer's entropy lemma. T…