Math 358, Spring 2007
Combinatorics and Graph Theory
Course description: Combinatorics is the study of arranging objects according to certain rules. Questions involve determining whether an arrangement is possible, and if so, how many arrangements are possible. The course covers a broad range of topics from both algorithmic and theoretical points of view. Click here for a more detailed schedule
Instructor: Barry Balof
Office: 236 Olin Hall
Location: 246 Olin Hall Time: Monday, Wednesday, and Friday, 1-1:50
Textbook: Combinatorics: Topics, Techniques, and Algorithms by Peter J. Cameron
Homework: Homework will be posted here . Homework will be assigned daily and collected weekly. It is recommended that you attempt all problems assigned, not just those that will be collected.
TURNING IN HOMEWORK LATE WILL RESULT IN A SUBSTANTIAL PENALTY. Your lowest homework score will be dropped.
Tests: This class will have a take-home midterm, given the week before Spring Break, and the option of an oral or take-home final
Project: Each student will be responsible for an independent project, which includes a one period presentation as well as a written report. These presentations will be done during the last five weeks of the semester. More details will be discussed in class.
Grading: Grades will be assigned on a rougly 90-80-70 scale, with grades weighted as follows.
Homework & Class Participation
Academic Honesty: Students are allowed, and in fact, strongly encouraged, to collaborate on homework assignments. However, the work that you turn in must be your own. No copying from any source! Exams will be closed book, closed notes, and closed colleague.
Special Needs: Any student with a disability for whom special accommodations would be helpful is encouraged to discuss this with the professor as soon as possible.