Jonathan Cutler

According to our database1, Jonathan Cutler authored at least 21 papers between 2002 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Supersaturation for Subgraph Counts.
Graphs Comb., 2022

2020
Homomorphisms into Loop-Threshold Graphs.
Electron. J. Comb., 2020

2018
Minimizing the number of independent sets in triangle-free regular graphs.
Discret. Math., 2018

2017
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree.
J. Graph Theory, 2017

Maximal-clique partitions and the Roller Coaster Conjecture.
J. Comb. Theory A, 2017

2016
The Multistep Friendship Paradox.
Am. Math. Mon., 2016

Counting dominating sets and related structures in graphs.
Discret. Math., 2016

A note on the values of independence polynomials at -1.
Discret. Math., 2016

2014
Extremal Graphs for Homomorphisms II.
J. Graph Theory, 2014

The maximum number of complete subgraphs in a graph with given maximum degree.
J. Comb. Theory B, 2014

2013
Hypergraph Independent Sets.
Comb. Probab. Comput., 2013

2012
Independent Sets in Graphs with Given Minimum Degree.
Electron. J. Comb., 2012

2011
Extremal graphs for homomorphisms.
J. Graph Theory, 2011

Negative Dependence and Srinivasan's Sampling Process.
Comb. Probab. Comput., 2011

Extremal Problems for Independent Set Enumeration.
Electron. J. Comb., 2011

An Entropy Proof of the Kahn-Lovász Theorem.
Electron. J. Comb., 2011

2010
On the interlace polynomials of forests.
Discret. Math., 2010

2009
Trees through specified vertices.
Discret. Math., 2009

2008
Unavoidable subgraphs of colored graphs.
Discret. Math., 2008

2006
Latin Squares with Forbidden Entries.
Electron. J. Comb., 2006

2002
The Interlace Polynomial of Graphs at - 1.
Eur. J. Comb., 2002


  Loading...