Publications

Preprints

	Jonathan Cutler, Nathan Kahl, and Phoebe Zielonka, A note on the alternating number of independent sets in a graph, submitted.
	Deepak Bal,             , and Luke Pebody, Nordhaus-Gaddum inequalities for the number of cliques in a graph, submitted.
	, Luke Pebody, and Amites Sarkar, Sums, differences, and dilates, submitted.

Papers

	Jonathan Cutler, JD Nir, and Jamie Radcliffe, Supersaturation for subgraph counts, Graphs and Combinatorics 38 (2022), P65.
	and Nicholas Kass, Homomorphisms into loop-threshold graphs, Electronic J. of Combin. 27 (2020), P2.38.
	and Jamie Radcliffe, Minimizing the number of independent sets in triangle-free regular graphs, Discrete Math. 341 (2018), 793–800.
	and Jamie Radcliffe, The maximum number of complete subgraphs of fixed size in a graph with given maximum degree, J. Graph Theory 84 (2017), 134–145.
	and Luke Pebody, Maximal-clique partitions and the Roller Coaster Conjecture, J. Combin. Theory Ser. A 145 (2017), 25–35.
	Josh Brown Kramer,             , and Jamie Radcliffe, The Multistep Friendship Paradox, Amer. Math. Monthly 123 (2016), 900-908.
	and Nathan Kahl, A note on the values of independence polynomials at −1, Discrete Math. 339 (2016), 2723–2726.
	and Jamie Radcliffe, Counting dominating sets and related structures in graphs, Discrete Math. 339 (2016), 1593–1599.
	and Jamie Radcliffe, Extremal graphs for homomorphisms II, J. Graph Theory 76 (2014), 42–59. Python program to check small cases can be found here.
	and Jamie Radcliffe, The maximum number of complete subgraphs in a graph with given maximum degree, J. Combin. Theory Ser. B 104 (2014), 60–71.
	and Jamie Radcliffe, Hypergraph independent sets, Combin. Probab. Comput. 22 (2013), 9–20.
	James Alexander,             , and Tim Mink, Independent sets in graphs with given minimum degree, Electronic J. of Combin. 19(3) (2012), #P37.
	and Jamie Radcliffe, Extremal problems for independent set enumeration, Electronic J. of Combin. 18(1) (2011), #P169.
	and Jamie Radcliffe, Extremal graphs for homomorphisms, J. Graph Theory 67 (2011), 261–284. Python program to check small cases can be found here.
	Josh Brown Kramer,             , and Jamie Radcliffe, Negative dependence and Srinivasan's sampling process, Combin. Probab. Comput. 20 (2011), 347–361.
	and Jamie Radcliffe, An entropy proof of the Kahn-Lovász theorem, Electronic J. of Combin. 18(1) (2011), #P10.
	Colin Anderson,             , Jamie Radcliffe, and Lorenzo Traldi, On the interlace polynomial of forests, Discrete Math. 310 (2010), 31–36.
	, Trees through specified vertices, Discrete Math. 309 (2009), 2749–2754.
	and Balázs Montágh, Unavoidable subgraphs of colored graphs, Discrete Math. 308 (2008), 4396–4413.
	and Lars-Daniel Öhman, Latin squares with forbidden entries, Electronic J. of Combin. 13 (2006), #R47.
	Paul Balister, Béla Bollobás,             , and Luke Pebody, The interlace polynomial of graphs at −1, European J. of Combin. 23 (2002), 761–767.

Technical Reports/Surveys

	Jonathan Cutler, Coloring graphs with graphs: a survey, Graph Theory Notes N.Y. 63 (2012), 7–16.
	and Roland Häggkvist, Cycle double covers of graphs with disconnected frames, Research report 6, Department of Mathematics, Umeå University (2004).

Dissertation

Jonathan Cutler, Extremal and Algebraic Graph Theory, Department of Mathematical Sciences, University of Memphis (2004).

Thesis

Jonathan Cutler, The Matthews-Sumner Conjecture, Department of Mathematical Sciences, University of Memphis (2000).