- There is no required text for this course. As the course proceeds, lecture notes will be prepared and posted on the course web site. For background material, students are encouraged to consult the lecture notes for Math 3012 - Spring 2007, posted on Professor Trotter's home page.
- The course will be structured around a series of elegant combinatorial theorems, drawn from graph theory, ramsey theory, discrete geometry, enumeration, extremal combinatorics and combinatorial optimization.
- There will be two tests (50 minutes in length) during the term and there will be a final exam. On these tests, students will be asked to write three to five proofs from a clearly defined and identified list of theorems. In each case, a full proof will be given in the lecture notes, and these proofs will be fully discussed and explained in class.
- Homework problems will be assigned. They will be two types of problems. The first type might be called "do for understanding." Students should work these problems in order to gain maximum benefit from the course. The second type will be "turn in for credit" problems. Students are encouraged to work together and to discuss fully the content of the course lectures as well as the homework problems. However, when writing the solutions of problems turned in for credit, students must work alone.
- Students are expected to attend all lectures without exception.
- Make up exams will be given only for (1) official representation of the Institute, and (2) documented medical emergencies. Visiting the Student Health Center does not result in documentation for an excused absence.
- Professor Trotter holds regularly scheduled office hours, and students are strongly encouraged to drop by for help. Come sooner rather than later. Experience shows that some Georgia Tech students are reluctant to ask for help. Don't fall into this trap.
Updated January 16, 2008.
