4 citations · 5 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
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★ 1 cited
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…
math.CO2012★ 4 cited
Vertex Isoperimetric Inequalities for a Family of Graphs on Z^k
Ellen Veomett, A. J. Radcliffe
We consider the family of graphs whose vertex set is Z^k where two vertices are connected by an edge when their l\infty-distance is 1. We prove the optimal vertex isoperimetric ine…