Feedback Form
- Instructor: Peter Keevash
- Grader: Benjamin Leitner
- Email: leitner@caltech.edu
- Office hours: Sunday 9.30pm
- Final office hours: Tuesday December 7, 9.30pm
| |
Course
Description:
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.
Textbook:
A Course in Combinatorics, by
J.H. van Lint and R.M. Wilson, 2nd
edition.
|
|
Homework and exams: Grades will be based
on weekly problem sets. There will be no exams. Students may
collaborate, provided they acknowledge their collaborators and
understand everything that they write.
|
Homework: Some problems are
from the textbook, and you may use the hints in the back of the book for
these. Turn in homework to Ma 121 box outside 253 Sloan.
-
#1 due October 4:
postscript ,
pdf
-
#2 due October 11:
postscript ,
pdf
-
#3 due October 18:
postscript ,
pdf
-
#4 due October 25:
postscript ,
pdf
-
#5 due November 1:
postscript ,
pdf
-
#6 due November 8:
postscript ,
pdf
-
#7 due November 16:
postscript ,
pdf
-
#8 due November 23:
postscript ,
pdf
-
#9 due December 2:
postscript ,
pdf
-
#10 due December 9:
postscript ,
pdf
|