Introduction to Combinatorics and Graph Theory - 0366.1123.01
Procedural Matters:
Desirable background: Introduction to Set Theory.
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.
Text books:
There are many books that cover the area, including the following.
A. Avron,
Introduction to Discrete Mathematics (in Hebrew)
N. Linial and M. Parnas,
Discrete Mathematics (in Hebrew)
J. Matousek and J. Nesetril,
Invitation to Discrete Mathematics.
Course syllabus:
Basic enumeration methods, the Binomial coefficients, the
pigeonhole principle, inclusion-exclusion, asymptotic estimates,
recurrence relations, generating functions, the basics of Graph
theory: connectivity, bipartite graphs, matchings.