Class materials

All references are taken from the course book:
מתמטיקה בדידה, של ליניאל/פרנס.

Num. Topic Reference Date
1 Introduction, the sum and product principlesChap. 4.124/02/19
2 The pigeon-hole principleChap. 4.525/02/19
3 Basic counting, choosing k out of n elementsChap. 4.203/03/19
4 The binomial coefficientsChap. 4.304/03/19
5 Combinatorial identities, Catalan numbersChap. 4.310/03/19
6 The multinomial coefficientsChap. 4.711/03/19
7 The inclusion-exclusion principleChap. 4.617/03/19
8 Applications of the inclusion-exclusion principle: disorders, Euler's functionChap. 4.624/03/19
9 Counting via recurrence relationsChap. 4.425/03/19
10 Solving linear homogeneous recurrence relationsChap. 6.131/03/19
11 More linear recurrencesChap. 6.201/04/19
12 Introduction to graph theoryChap. 507/04/19
13 Basic properties of graphsChap. 5.108/04/19
14 Graph families, treesChap. 5.228/04/19
15 Bipartite graphs, planar graphsChap. 5.229/04/19
16 Graph coloringChap. 5.512/05/19
17 Paths in graphs: Euler tourChap. 5.313/05/19
18 Hamiltonian pathsChap. 5.319/05/19
19 Extremal graph theory: Ramsey, MantelChap. 5.720/05/19
20 Counting treesChap. 5.626/05/19
21 Matchings in graphs, Hall's theoremChap. 5.427/05/19
22 Introduction to discrete probabilityChap. 8.102/06/19
23 Independence, conditional probabilityChap. 8.203/06/19
24 Random variables, expectation, distributionsChap. 8.310/06/19
25 Variance and tail boundsChap. 8.5,8.716/06/19
26 The probabilistic methodChap. 8.817/06/19