Math 636: Advanced Combinatorics and Graph Theory; Spring 2019.

Time and Location: MW 11:45-1 in Leigh 410.

Instructor: Dr. James (JP) Cossey
  • Office: CAS 234
  • Office Phone: 330 972 8127
  • Email is (which is the best way to get a hold of me)
  • Office hours:
    • Tu 2-3
    • Wed 1-2
    • Fri 2-3
  • If you can't make my office hours, let me know and we can try to set up a time to meet. Here is my schedule for the spring semester.
Suggested books and papers: There will be no "required" text book for this class. At times, we may be closely following either Chapter 14 (on Polya enumeration) of Brualdi's "Introductory Combinatorics" (5th edition), or Chapters 3 and 4 of Tucker's "Applied Combinatorics" (on trees and network algorithms).
We will also be using some journal articles and other sources, and I will post copies of those here as we need them.

PLEASE NOTE: The official prerequisite for this class is Math 415/515, Introduction to Combinatorics and Graph Theory. There are some of you enrolled in this class who have not had this prerequisite, and as such, you will need to do some catching up. In particular, for those not familiar with generating functions and recurrence relations, I strongly encourage reading and working through Chapter 7 of the Brualdi book, and for those not familiar with the basics of graph theory, Chapter 11 of Brualdi's book is recommended.

Course Syllabus.
The syllabus will include information about grading policies, etc. You should definitely read it.
Homework will be due once every two weeks or so and will be posted here.
There will be no exams in this class. All of your grade will come from the homework and the project.

At the end of the semester each student will be responsible for both a short in-class presentation AND a short (3-5 page) paper on a topic in combinatorics or graph theory. These will likely evolve from topics discussed in class, but any advanced topic in combinatorics or grapth theory is good, as long as you clear it with me first. Here is a list of potential topics, although this list is far from exhaustive.