Jonathan Cutler

activity

20132019

most citedSupersaturation for subgraph counts

14 citations · 15 across the 6 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

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…

Maximal-clique partitions and the Roller Coaster Conjecture

A note on the values of independence polynomials at −1

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