Math 358, Fall 2015
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: 315 Olin Hall Time: Mondays, 10-10:50, Wednesdays and Fridays, 11-11:50
Textbook: An Introduction to Combinatorics and Graph Theory by David Guichard. A .pdf copy is available here
Homework: Homework will be posted here . Problem sets will be collected weekly. You are encouraged to attempt unassigned exercises from the text as well.
TURNING IN HOMEWORK LATE WILL RESULT IN A SUBSTANTIAL PENALTY. Your lowest homework score will be dropped.
Quizzes and Tests: This class will have two midterm exams and a final. The first midterm will be in the week after Fall Break. The second midterm will be the penultimate week before Thanksgiving Break. The final, as set by the Registrar’s office, will be Friday, December 18, from 2-4 PM
Project: Students will be responsible for group projects, which include a half-hour presentation as well as a written report. These presentations will be done during the last two 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.