| Math 121a |
|
| Combinatorial Analysis | |
| Fall 2006-07 | |
TR 9:00 - 10:30 AM, 257 Sloan |
Instructor:
Peter Keevash, 280 Sloan, 395-4369, keevash at caltech dot edu
Grader: Benjamin Leitner, 156 Sloan, leitner at caltech dot edu, Office hour: Tuesdays, 10pm |
| Solutions to the final exam are due by 5pm on Wednesday December 6th. If you did not get a copy in class you can collect one from the math office. There will be no further classes. |
|
Ma 121abc is the advanced undergraduate and/or introductory graduate course in combinatorial mathematics. The emphasis this term (Ma 121a) will be on the foundations of combinatorics, including background material from graph theory, extremal set theory, partially ordered sets, enumeration, partitions and combinatorial optimization. The text will serve as a guide, but we may also cover some material not from the book. |
| Grades
will be calculated according to the following scheme: 75%: Coursework. This part of the grade will be based on homework assignments. You may discuss homework problems with other students, and use any hints that are available. You are required to understand your answer completely and write it in your own words. Copying is not permitted.Late homework will not be tolerated in this class. Any work received after its deadline will receive no credit. 25%: Final. The final will be a 3 hour written examination, in which no consultation with other people or outside sources will be permitted.
|
|
Here are some lecture notes from Prof. Wilson:
1
2
3
|
|
|