Introduction to Combinatorics and Graph Theory - 0366.1123
Noga Alon ( firstname.lastname@example.org )
2nd (=Spring) Semester, 2015-2016, Monday 14-16, Melamed Hall
School of Mathematics
Instructor: Gal Kronenberg
Desirable background: Introduction to Set Theory, Linear Algebra
1, Calculus 1.
Exercises will be given during the course and their solutions will
be graded and form about 10% of the final grade.
There will also be a final exam.
There are many books that cover the area, including the following.
Introduction to Discrete Mathematics (in Hebrew)
N. Linial and M. Parnas,
Discrete Mathematics (in Hebrew)
J. Matousek and J. Nesetril,
Invitation to Discrete Mathematics.
Basic enumeration methods, the Binomial coefficients and Catalan
pigeonhole principle, inclusion-exclusion, asymptotic estimates,
recurrence relations, generating functions, the basics of Graph
theory: connectivity, bipartite graphs, matchings.
(Much) more relevant information, including exercises,
in the course page in Moodle:
Introduction to Combinatorics and Graph Theory
Course Outline (to be updated during the term):
Exams from previous years:
Spring 2010, Moed A
Spring 2010, Moed B
Spring 2011, Moed A
Spring 2011, Moed B
Spring 2013, Moed A
Spring 2013, Moed B
Spring 2014, Moed A
Spring 2014, Moed B
Spring 2015, Moed A
Spring 2016, Moed A
Introduction, Basic enumeration methods, Basic enumeration
The Binomial coefficients
The pigeonhole principle,
The Erdos Szekeres Theorem
More recurrence relations, generating functions
More Generating functions
End of generating functions, Basic Graph Theory
May 30 (3 hours):
More Graph Theory
End of Graph Theory, conclusion