Theoretical / proof-based
Combinatorics · Graduate · Math
Topics
Enumerative combinatorics
- Generating functions: ordinary and exponential
- Recurrence relations and transfer matrices
- Inclusion–exclusion and Möbius inversion on posets
- Polya enumeration and cycle index
- Asymptotic enumeration (introduction)
Graph theory and extremal problems
- Turán's theorem and extremal graph theory
- Ramsey theory: finite and infinite (introduction)
- Matchings, factors, and Tutte's theorem
- Planarity: Kuratowski's and Wagner's theorems (statements)
- Spectral graph theory (introduction)
Algebraic and geometric combinatorics
- Combinatorial Nullstellensatz and polynomial method
- Matroids: definitions, bases, and duality
- Symmetric functions and Young tableaux (introduction)
- Incidence algebras and Möbius functions
- Lattice paths and binomial identities
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Combinatorics · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle or Venmo.