This is a combination of two co-located courses, ``Honors Combinatorics and Probability'' (Math-28400 = CS-27400) and ``Combinatorics'' (Math-37200 = CS-37200).
While the class material is the same, the requirements for the graduate credit are considerably higher than those for the undergraduate credit. Those seeking graduate (37200) credit will have extra assignments and are expected to show a deeper understanding of the course material.
Instructor: László Babai Ryerson 164 e-mail:
laci@cs.uchicago.edu.
Office hours: by appointment (please send e-mail)
TA1: Hari Narayanan hari@cs.uchicago.edu.
TA2: Raghav Kulkarni raghav@cs.uchicago.edu.
Hari holds office hours Monday, Tuesday, Thursday 5:30-6:30pm in Ry 255.
Text. Your primary text will be your course notes, so please
make sure you don't miss classes. If you do, you should copy
somebody's class notes and discuss the class with them.
Printed texts:
J. Matoušek, J. Nešetríl: ``Invitation to Discrete Mathematics,''
available at the Seminary Coop Bookstore (University Ave. at 58th St.).
L.Babai and P. Frankl: ``Linear Algebra Methods in Combinatorics,'' book manuscript, 1992.
Available from the Dept. C.S. office (Ry-152, ask Andrea, $ 20)
Numerous handouts will accompany the course, including class notes, and chapters of the Discrete Math course handouts for the benefit of those who did not attend Discrete Math or need a refresher.
Recommended advanced texts:
L. Lovász: ``Combinatorial Problems and Exercises,''
North-Holland 1979; 2nd ed. Elsevier 1992.
N. Alon, J.H. Spencer: ``The Probabilistic Method'' J.Wiley, Publ., 1992
J.H.VanLint and R.M.Wilson: ``A Course in Combinatorics,'' Cambridge University Press, 1992.
Reinhard Diestel: ``Graph Theory''
Springer; available online (can be downloaded but cannot be printed)
If you have not taken ``Discrete Mathematics'' (CS-17400) or
a similar introduction to combinatorics, number theory,
graph theory, finite probability, and asymptotic notation,
you may want to consult an introductory text, such as
Richard A. Brualdi: ``Introductory Combinatorics''
Alan Tucker: ``Applied Combinatorics''
Kenneth Rosen: ``Discrete Mathematics and Its Applications.''
Grading will be based on three midterm exams, the two best of which will count (40% each) and a take-home test (20%). Midterm dates: Wednesday, April 13; Wednesday, May 25; Wednesday, June 1. Take-home test: Friday, April 29 (due Monday, May 2).
Most of the test problems will previously have been assigned in class. Class notes are posted on the course website; please check for the ``revised/proofread version.'' (For the sake of fast communication, often an unproofread copy is first distributed in class. These copies are clearly marked ``not proofread'' and tend to contain numerous errors. Be sure to discard them once the proofread copies are available. Check the website; the proofread copies are posted there as soon as they are available.)
A REQUEST. Please send e-mail to the instructor
with Subject: ``comb class''
Please include the following information. Your answers will help me in designing the course.