Preprints
 |
Jonathan Cutler
and Jamie Radcliffe,
An entropy proof of the Kahn-Lovász theorem,
in preparation. |
| |
,
Josh Brown Kramer, and Jamie Radcliffe,
Negative dependence and Srinivasan's sampling process,
in preparation. |
| |
and Jamie Radcliffe,
Extremal graphs for homomorphisms,
submitted to J. Graph Theory.
Python program to check small cases can be found
here.
|
| |
and Luke Pebody, On the geodetic number of digraphs (2000), manuscript. |
Papers
| |
Jonathan Cutler,
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). |
|
|