1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Nordhaus-Gaddum inequalities for the number of cliques in a graph
Deepak Bal, Jonathan Cutler, Luke Pebody
Nordhaus and Gaddum proved sharp upper and lower bounds on the sum and product of the chromatic number of a graph and its complement. Over the years, similar inequalities have been…
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…
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…
The maximum number of complete subgraphs of fixed size in a graph with given maximum degree
Jonathan Cutler, A. J. Radcliffe
In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs w…