Publications

Preprints

	Jonathan Cutler and Jamie Radcliffe, Extremal graphs for homomorphisms II, submitted. Python program to check small cases can be found here.
	James Alexander,             , and Tim Mink, Independent sets in graphs with given minimum degree, submitted.
	and Jamie Radcliffe, Hypergraph independent sets, submitted.

Papers

	Jonathan Cutler 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, Combinatorics, Probability and Computing 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 Mathematics 310 (2010), 31–36.
	, Trees through specified vertices, Discrete Mathematics 309 (2009), 2749–2754.
	and Balázs Montágh, Unavoidable subgraphs of colored graphs, Discrete Mathematics 308 (2008), 4396–4413.
	and Lars-Daniel Öhman, Latin squares with forbidden entries, Electronic J. of Combin. 13 (2006), #R47.
	and Roland Häggkvist, Cycle double covers of graphs with disconnected frames, Research report 6, Department of Mathematics, Umeå University (2004).
	Paul Balister, Béla Bollobás,             , and Luke Pebody, The interlace polynomial of graphs at –1, European J. of Combin. 23 (2002), 761–767.

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).