Jonathan Cutler - Department of Mathematics

Jonathan Cutler
Curriculum Vitae
Department of Mathematics work: (402) 472-9119
Avery Hall 238 fax: (402) 472-8466
University of Nebraska-Lincoln jcutler2@math.unl.edu
Lincoln, NE 68588-0130 http://www.math.unl.edu/~jcutler2/
Education
2004 Ph.D., University of Memphis, Memphis, TN
Dissertation: Extremal and Algebraic Graph Theory
Advisor: Dr. Béla Bollobás
2000 M.Sc., University of Memphis, Memphis, TN
Thesis: The Matthews-Sumner Conjecture
Advisor: Dr. Richard Schelp
1998 B.A., Carleton College, Northfield, MN
Positions Held
2005–present Research Assistant Professor, University of Nebraska-Lincoln
Fall 2004 Post-doctoral Research Fellow, Ume˚a University, Ume˚a, Sweden
2000–2004 Van Vleet Memorial Doctoral Research Assistant, University of Memphis
1998–2000 Graduate Teaching Assistant, University of Memphis
1996–1998 Math Skills Center Tutor, Carleton College
Summer 1997 Counselor, San Antonio Prefreshman Engineering Program, University of Texas at
San Antonio
Academic Visits
June 2006 Institute for Mathematical Sciences, National University of Singapore, Singapore
Throughout Ph.D. Trinity College/Department of Pure Mathematics and Mathematical Statistics, University
of Cambridge, Cambridge, England
April 2002 Microsoft Research Theory Group, Redmond, WA
Fall 1997 Budapest Semesters in Mathematics, Budapest, Hungary
Teaching Experience
University of Nebraska-Lincoln
Fall 2006 Szemerédi’s Regularity Lemma (Graduate)
Contemporary Mathematics
Spring 2006 Graph Theory (Graduate)
Elementary Analysis
Fall 2005 Contemporary Mathematics
Combinatorics (Graduate)
Spring 2005 Analytic Geometry & Calculus III
Matrix Theory
University of Memphis
2000 Concepts of Algebra/Foundations of Mathematics II, 3 total sections
1999–2000 Concepts of Number/Foundations of Mathematics I, 6 total sections
1

Curriculum Vitae Jonathan Cutler
Awards
2006-2007 Project NExT Fellow (Sepia Dot), MAA and University of Nebraska-Lincoln, sponsors
2000-2004 Van Vleet Memorial Doctoral Research Fellowship
1999 Outstanding Tutor Award, Math Tutoring Center, University of Memphis
Research Papers
1. “The interlace polynomial of graphs at −1” with P. Balister, B. Bollobás, L. Pebody. European J. of
Combin. 23 (2002), 761-767.
2. “On the geodetic number of digraphs” with L. Pebody, manuscript.
3. “On a Ramsey-type problem” with B. Montágh, to appear in Discrete Mathematics.
4. “On a problem of Horak,” submitted to Discrete Mathematics.
5. “Cycle double covers of graphs with disconnected frames” with R. Häggkvist. Research report 6, 2004,
Department of Mathematics, Ume˚a University.
6. “Latin squares with forbidden entries” with L.-D. Öhman. Electronic J. of Combin. 13 (2006), #R47.
7. “On the number of complete bipartite graphs in a graph” with J. Radcliffe, in preparation.
8. “Entropy, Shearer’s Lemma and odd cycles” with J. Radcliffe, in preparation.
9. “The interlace polynomial on trees” with C. Anderson and J. Radcliffe, in preparation.
Invited Lectures
November 2006 “On the number of complete bipartite subgraphs of a graph,” AMS Sectional Meeting,
Special Session on Extremal and Probabilistic Combinatorics, Fayetteville, AR
April 2005 “Latin squares with forbidden entries,” AMS Sectional Meeting, Special Session on
the Probabilistic Paradigm in Combinatorics, Dover, DE
February 2005 “On the cycle double cover conjecture,” Mathematics Department Colloquium, University
of Nebraska–Lincoln
March 2003 “The geodetic number of digraphs,” Mathematics Department Colloquium, Gettysburg
College, Gettysburg, PA
Research Talks
2005-present Numerous talks, Combinatorics seminar, University of Nebraska-Lincoln
June 2006 “On the number of complete bipartite subgraphs of a graph,” Random Graphs and
Large-Scale Real-World Networks, Institute for Mathematical Sciences, National
University of Singapore, Singapore
October 2005 “On a problem of Horak,” AMS Sectional Meeting, Special Session in Graph Theory,
Lincoln, NE
December 2004 “Avoiding multiple entry arrays,” Discrete Mathematics Group Seminar, Ume˚a University,
Ume˚a, Sweden
October 2004 “On a problem of Horak,” 8th Nordic Combinatorial Conference, Aalborg University,
Aalborg, Denmark
August 2004 “On a problem of Horak,” Discrete Mathematics Group Seminar, Ume˚a University,
Ume˚a, Sweden
February 2004 “On a problem of Horak,” Combinatoria, Probabilidade e Computação, Instituto
Nacional de Matemática Pura e Aplicada, Rio de Janeiro, Brasil
February 2002 “On the geodetic number of digraphs,” 33rd Southeastern Conference on Combinatorics,
Graph Theory and Computing, Florida Atlantic University, Boca Raton,
FL
February 2001 “The interlace polynomial of graphs at −1,” 32nd Southeastern Conference on
Combinatorics, Graph Theory and Computing, Louisiana State University, Baton
Rouge, LA
2

Curriculum Vitae Jonathan Cutler
Journals Refereed
Winter 2007 Annals of Combinatorics
Fall 2006 Graphs and Combinatorics
Spring 2006 Journal of Combinatorial Theory, Series B
Spring 2004 Discrete Applied Mathematics
Research-Related Grants
November 2006 Travel grant to EXCILL: Extremal Combinatorics at Illinois, University of Illinois
at Urbana-Champaign
June 2006 Travel grant to Random Graphs and Large-Scale Real-World Networks, National
University of Singapore, Singapore
March 2006 Travel grant to Paul Erdős Memorial Lecture Series, Memphis, TN
December 2005 Travel grant to University of Memphis, Memphis, TN
February 2004 Travel grant to Combinatoria, Probabilidade e Computação, Instituto Nacional de
Matemática Pura e Aplicada, Rio de Janeiro, Brasil
Summer 2003 Research grant from the Heilbronn Fund, Trinity College, Cambridge
Summer 2002 Research grant from the Heilbronn Fund, Trinity College, Cambridge
August 2001 Travel grant to Random Structures and Algorithms Conference, Poznań, Poland
July 2001 NATO grant to European Summer School, “Asymptotic Combinatorics with Applications
to Mathematical Physics,” St. Petersburg, Russia
Summer 2001 Research grant from the Heilbronn Fund, Trinity College, Cambridge
Service
2006-present Co-writer and grader of Combinatorics and Graph Theory qualifying exams, University
of Nebraska-Lincoln
2006-present Organizer of combinatorics seminar, University of Nebraska-Lincoln
June 2006 Lecturer, high school student problem session, National University of Singapore
April 2006 Reader of undergraduate honors thesis, University of Nebraska-Lincoln
Fall 2006 Organizer of Academic Job Search Workshop, University of Nebraska-Lincoln
2005-2006 Co-advised undergraduate student, Colin Anderson, on honors thesis, University of
Nebraska-Lincoln, Colin graduated with highest distinction
October 2005 Co-organizer of Special Session in Graph Theory, AMS Sectional Meeting, Lincoln,
NE
Fall 2005 Co-writer of advanced exam for high school students, Math Day, University of
Nebraska-Lincoln
2003-2004 Founder and Chair of Graduate Student Association Leadership Council Committee
for New Graduate Student Orientation, University of Memphis
2003-2004 Mathematics Department Representative to the Graduate Student Association
Leadership Council, University of Memphis
Professional Societies
1999-present American Mathematical Society
3