MATH 465
Introduction to Combinatorics
An introduction to combinatorics, covering basic counting techniques (inclusion-exclusion, permutations and combinations, generating functions) and fundamentals of graph theory (paths and cycles, trees, graph coloring). Additional topics may include partially ordered sets, recurrence relations, partitions, matching theory, and combinatorial algorithms.
Prerequisites & course information
Linear Algebra (one of MATH 214, 217, 256, 286, 296, 417, or 419) or permission of instructor. (3). (BS). May not be repeated for credit. No credit granted to those who have completed or are enrolled in MATH 565 or 566. Rackham credit requires additional work.
Sources
- Course catalogue ↗2026-2027
- Catalogue entry ↗
Catalogue variants
- Introduction to Combinatorics · 3 · Graduate credit