Math 636: Advanced Combinatorics and Graph Theory; Spring 2013.
Time and Location:
MWF 3:20 to 4:10 in CAS 139.
Dr. James (JP) Cossey
Suggested books and papers: There will be no "required" text book for this class. At times, we will 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).
- Office: CAS 234
- Office Phone: 330 972 8127
- Email is email@example.com (which is the best way to get a hold of
- Office hours:
- Mon 2-3
- Tues 1-2
- Thurs 9-10 (this may end up being moved)
- If you can't make my office hours, let me know and we can try to
a time to meet. Here is my schedule
for the fall semester.
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.
The syllabus will include information about grading
policies, exam schedules and policies, etc. You
should definitely read it.
Also, here is an approximate schedule of what we'll be covering this semester. This is VERY approximate.
Homework will be due once a week or so. All of the homework problems will come from this list:
636 homework list
except the graph theory problems, which will come from this list of graph theory problems.
This list will be updated throughout the semester. Most, if not all of the problems on this list will be mentioned in class.
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 (although you may work in pairs if you like) 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.