Jonathan Cutler
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the number of monochromatic cliques in a graph The Electronic Journal of Combinatorics | 2025-09-25 | Paper |
| Supersaturation for subgraph counts Graphs and Combinatorics | 2022-03-21 | Paper |
| Homomorphisms into loop-threshold graphs The Electronic Journal of Combinatorics | 2020-06-04 | Paper |
| The multistep friendship paradox The American Mathematical Monthly | 2018-07-12 | Paper |
| Minimizing the number of independent sets in triangle-free regular graphs Discrete Mathematics | 2018-01-19 | Paper |
| Maximal-clique partitions and the roller coaster conjecture Journal of Combinatorial Theory. Series A | 2017-02-09 | Paper |
| The maximum number of complete subgraphs of fixed size in a graph with given maximum degree Journal of Graph Theory | 2017-02-01 | Paper |
| A note on the values of independence polynomials at \(-1\) Discrete Mathematics | 2016-07-05 | Paper |
| Counting dominating sets and related structures in graphs Discrete Mathematics | 2016-04-07 | Paper |
| Extremal graphs for homomorphisms. II Journal of Graph Theory | 2014-05-28 | Paper |
| The maximum number of complete subgraphs in a graph with given maximum degree Journal of Combinatorial Theory. Series B | 2014-02-06 | Paper |
| Hypergraph Independent Sets Combinatorics, Probability and Computing | 2013-01-21 | Paper |
| Independent sets in graphs with given minimum degree The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
| Extremal problems for independent set enumeration The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
| Extremal problems for independent set enumeration The Electronic Journal of Combinatorics | 2011-10-18 | Paper |
| Extremal graphs for homomorphisms Journal of Graph Theory | 2011-08-16 | Paper |
| Negative dependence and Srinivasan's sampling process Combinatorics, Probability and Computing | 2011-05-11 | Paper |
| An entropy proof of the Kahn-Lovász theorem The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
| An entropy proof of the Kahn-Lovász theorem The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
| Trees through specified vertices Discrete Mathematics | 2009-12-09 | Paper |
| Unavoidable subgraphs of colored graphs Discrete Mathematics | 2008-09-04 | Paper |
| Latin squares with forbidden entries The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
| Latin squares with forbidden entries The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
| The interlace polynomial of graphs at \(-1\) European Journal of Combinatorics | 2003-03-18 | Paper |
| Sums, Differences and Dilates (available as arXiv preprint) | N/A | Paper |
Research outcomes over time
This page was built for person: Jonathan Cutler
