Time and Location: MWF 3:20 to 4:10 in CAS 139.

Instructor: Dr. James (JP) Cossey

- Office: CAS 234

- Office Phone: 330 972 8127

- Email is cossey@uakron.edu (which is the best way to get a hold of
me)

- 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 set up 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.

- A paper by Moon and Moser that counts the number of *distinct* triangulations of an n-gon.
- A discussion of the generalized Catalan numbers by Hilton and Pedersen.
- The masters theses of Joe Auger and Brittany Mott, who worked on the question of dissecting n-gons into k-gons.

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, 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

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.

- HOMEWORK 1: Due Friday, January 25th. Problems 1-5 of the master list.

- HOMEWORK 2: Due Friday, February 1st. Problems 6-12 of the master list.

- HOMEWORK 3: Due Monday, February 11th. Problems 13-18 of the master list.

- HOMEWORK 4: Due Wednesday, February 20th. Problems 19-25 of the master homework list.

- HOMEWORK 5: Due Monday, March 4th. Problems 26-36 of the master homework list.

- HOMEWORK 6: Due Wednesday, March 13th. Problems 1-9 of the list of graph theory problems.

- HOMEWORK 7: Due Wednesday, April 3rd. Problems 10-16 of the list of graph theory problems

- HOMEWORK 8: Due Friday, April 26th. Problems 37-46 of the master homework list.

Exams

There will be no exams in this class. All of your grade will come from the homework and the project.

Projects

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.