MATH 462
Combinatorial Theory II
Structural theorems and methods in combinatorics, including those from extremal combinatorics and probabilistic combinatorics. Topics may include graphs, trees, posets, strategic games, polytopes, Ramsey theory, and matroids. Prerequisite: a minimum grade of 2.0 in either MATH 461 or CSE 421.
Sources
- Course catalogue ↗Current public catalogue; retrieved 2026-11-05