- Lecture 1 – August 18, 2015
- Lecture 2 – August 20, 2015
- Lecture 3 – August 25, 2015
- Lecture 4 – August 27, 2015
- Lecture 5 – September 1, 2015
- Lecture 6 – September 3, 2015
- Lecture 7 – September 8, 2015
- Lecture 8 – September 10, 2015
- Lecture 9 – September 15, 2015
- Lecture 10 – September 22, 2015
- Lecture 11 – September 24, 2015
- Lecture 12 – September 29, 2015
- Lecture 13 – October 1, 2015
- Lecture 14 – October 6, 2015
- Lecture 15 – October 8, 2015
- Lecture 16 – October 15, 2015
- Lecture 17 – October 20, 2015
- Lecture 18 – October 27, 2015
- Lecture 19 – October 29, 2015
- Lecture 20 – November 3, 2015
- Lecture 21 – November 5, 2015
- Lecture 22 – November 10, 2015
- Lecture 23 – November 12, 2015
- Lecture 24 – November 17, 2015
- Lecture 25 – November 19, 2015
- Lecture 26 – December 1, 2015
- Lecture 27 – December 3, 2015

- Home
- Additional Resources
- Lecture Videos
- Lecture 1 – Motivating Questions
- Lecture 2 – Enumeration Basics
- Lecture 3 – Binomial Coefficients, Lattice Paths, & Recurrences
- Lecture 4 – Mathematical Induction & the Euclidean Algorithm
- Lecture 5 – Multinomial Theorem, Pigeonhole Principle, & Complexity
- Lecture 6 – Induction Examples & Introduction to Graph Theory
- Lecture 7 – More Graph Theory Basics: Trees & Euler Circuits
- Lecture 8 – Hamiltonian Graphs, Complexity, & Chromatic Number
- Lecture 9 – Chromatic Number vs. Clique Number & Girth
- Lecture 10 – Perfect Graphs, Interval Graphs, & Coloring Algorithms
- Lecture 11 – Planar Graphs & Euler’s Formula
- Lecture 12 – More on Coloring & Planarity
- Lecture 13 – Introduction to Posets
- Lecture 14 – Posets: Mirsky’s & Dilworth’s Theorems
- Lecture 15 – Cover Graphs, Comparability Graphs, & Transitive Orientations
- Lecture 16 – Interval Order & Interval Graph Algorithms