18.211 Combinatorial Analysis


Class Info

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.

This class has 18.02, 18.06, 18.700, and 18.701 as prerequisites.

18.211 will be offered this semester (Fall 2017). It is instructed by M. Rahman.

Lecture occurs 2:00 PM to 3:00 PM on Mondays, Wednesdays and Fridays in 2-147.

This class counts for a total of 12 credits.

You can find more information at the MIT + 18.211 - Google Search site.

Required Textbooks
Save up to a ton by purchasing through MIT Textbooks!
MIT 18.211 Combinatorial Analysis Related Textbooks
MIT 18.211 Combinatorial Analysis On The Web

© Copyright 2015