Discrete Mathematics

The course Discrete Mathematics is roughly divided into two component: enumerative combinatorics and graph theory. The following textbooks are recommended for these two parts:

A Course in Combinatorics, van Lint and Wilson, Cambridge University Press. This item be purchased from here.

Modern Graph Theory, Bollobas, Springer Verlag. This item be purchased from here.

Lecture Notes

Weeks 1-2: Binomial coefficients, Stirling number

Week 3: Generating functions I (basic properties)

Week 4: Generating functions II (Ehrhart theorem, examples)

Week 5: Preparation (Groups: definitions and examples)

Problem Sets

Problem Set 1

Problem Set 2

Problem Set 3

Problem Set 4

Problem Set 5

Problem Set 6

Problem Set 7

Problem Set 8