Computer Science 575/Math 513
Combinatorics and Graph Theory
Fall 2002
Course
Administration
This is an introductory course in graph theory and combinatorics. The course has a lecture format. It meets twice a week. Combinatorics and Graph Theory is distinguished by the incredible number and variety of very interesting problems, and these problems are constitute the basis of the course.
Instructor: Robert Moll, CS BLDG 236, 545-4315, email: moll@cs.umass.edu
Office hours: M 1:30-2:15; W 2:45-3; TH 2:30 3:30; F 2-3
Meeting: Elab 304, TuTh 1-2:15 (notice room change from original schedule book)
Textbook: Applied Combinatorics, Alan Tucker, Wiley, 4rd edition. Other texts on reserve
Grading: 50% homework problems; 15% midterm; 35% final. In addition, you must pass the final to pass the class. Collaborative solutions are allowed for homework problems marked "c". You are expected to work problems not marked "c" on your own. Homework problems are due in class on collection day. By and large late homework will not be accepted.