Jonathan Cutler

most citedThe maximum number of complete subgraphs of fixed size in a graph with given maximum degree

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2016

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…

math.CO2014

Maximal-clique partitions and the Roller Coaster Conjecture

Jonathan Cutler, Luke Pebody

A graph $G$ is {\em well-covered} if every maximal independent set has the same cardinality $q$ . Let $i_{k} (G)$ denote the number of independent sets of cardinality $k$ in $G$ . Brown…

math.CO2014

A note on the values of independence polynomials at $- 1$

Jonathan Cutler, Nathan Kahl

The independence polynomial $I (G; x)$ of a graph $G$ is $I (G; x) = \sum_{k = 1}^{α (G)} s_{k} x^{k}$ , where $s_{k}$ is the number of independent sets in $G$ of size $k$ . The decycling number of…

math.CO2014★ 1 cited

The maximum number of complete subgraphs of fixed size in a graph with given maximum degree