14 citations · 15 across the 6 of their papers we have counts for
7 papers
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…
Minimizing the number of independent sets in triangle-free regular graphs
Jonathan Cutler, A. J. Radcliffe
Recently, Davies, Jenssen, Perkins, and Roberts gave a very nice proof of the result (due, in various parts, to Kahn, Galvin-Tetali, and Zhao) that the independence polynomial of a…
Homomorphisms into loop-threshold graphs
Jonathan Cutler, Nicholas Kass
Many problems in extremal graph theory correspond to questions involving homomorphisms into a fixed image graph. Recently, there has been interest in maximizing the number of homom…
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…
Maximal-clique partitions and the Roller Coaster Conjecture
Jonathan Cutler, Luke Pebody
A graph is {\em well-covered} if every maximal independent set has the same cardinality . Let denote the number of independent sets of cardinality in . Brown…
A note on the values of independence polynomials at
Jonathan Cutler, Nathan Kahl
The independence polynomial of a graph is , where is the number of independent sets in of size . The decycling number of…