18.211
Combinatorial Analysis
Combinatorial problems and methods for their solution. Enumeration, generating functions, recurrence relations, construction of bijections. Introduction to graph theory. Prior experience with abstraction and proofs is helpful.
Prerequisites & course information
Prereq: Calculus II (GIR) and ( 18.06 , 18.700 , or 18.701 ) U (Fall) 3-0-9 units
Sources
- Course catalogue ↗2026–2027