110-2 Combinatorial Mathematics

About the Final Grading.

 

Topics

Slides / Notes

HWs

 W9 - 4/11

The Pigeonhole Principle

HW #5  (updated)
due - 4/25, 6pm

 W10 - 4/18

System of Distinct Representatives
(Hall's matching / marriage theorem)

Maximum Bipartite Matching 

 W11 - 4/25
 W12 - 5/2

Weighted Bipartite Matching
(The Hungarian algorithm)

 W13 - 5/9

The Max-Flow Min-Cut Theorem

Slides #12 (slightly updated, 5/15)

Note #12

Program Assignment  #3
due - 5/22
(deadline extended)

 W14 - 5/16

none

HW #6
due - 5/23, 6pm

 W15 - 5/23

Eigenvalues and graph expansions

 W16 - 5/30

***** Final exam *****

Range to cover: W1 - W14, excluding the supplementary content

Chains and antichains
Blocking set and the duality

Intersecting families

Some (not-so-important) Q&As, keep updating...

 W1 - 2/14

Basic counting,
Principle of inclusion-exclusion (1)

HW #1  due - 3/1

 W2 - 2/21

Probabilistic counting

HW #2  due - 3/6
(updated)

 W3 - 2/28*

 W4 - 3/7

The Lovász sieve and the local lemma

Slides #3Jamboard
    (updated, 3/11)

HW #3  
due - 3/14, 6pm
(updated)

 W5 - 3/14

Miscellaneous topics in counting

HW #4  
due - 3/21, 6pm

 W6 - 3/21

Supplement: The Algorithmic Lovász local lemma

none

 W7 - 3/28

*** Midterm exam ***  

Range to cover: W1 - W6, excluding the supplementary content

 W8 - 4/4*