Topic |
Reading |

Pigeonhole principle |
Ch. 1 |

Mathematical induction |
Ch. 2 |

Permutations and Binomial coefficients |
Ch. 3 |

Binomial Theorem and identities |
Ch. 4 |

Compositions and multisets |
Ch. 5.1 |

Counting restricted arrangements |
Supplementary handout |

Set and integer partitions |
Ch. 5.2 - 5.3 |

Inclusion-Exclusion principle |
Ch. 7 |

Permutation cycles |
Ch. 6 |

Fibonacci numbers |
Supplementary handout |

Catalan numbers and counting lattice paths |
Ch. 14.1 and supplementary handout |

Ordinary generating functions |
Ch. 8.1 + Ch. 2.1 - 2.2 from 'generatingfunctionology' |

Exponential generating functions |
Ch. 8.2 + Ch. 2.3 from 'generatingfunctionology' |

The exponential formula |
Ch. 8.2 + Ch. 3.1 - 3.4 from 'generatingfunctionology' |

Graph theory: the basics |
Ch. 9.1, 9.4, 10.1, 11.2 |

Eulerian circuits |
Ch. 9.1 |

Hamiltonian cycles |
Ch. 9.2 |

Trees and Cayley's Theorem |
Ch. 10.2, 10.4, 3.12 from 'generatingfunctionology' |

Matchings |
Ch. 11.3 - 11.5 |

Independent sets and graph coloring |
Lecture notes |

Probabilistic techniques |
Lecture notes |

Turan's extremal graph theorem |
Lecture notes |