18.314 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.06, 18.700, and 18.701 as prerequisites.

18.314 will not be offered this semester. It will be instructed by R. P. Stanley.

This class counts for a total of 12 credits.

In the Fall 2014 Subject Evaluations, 18.314 was rated 6.3 out of 7.0. You can find more information on MIT OpenCourseWare at the Combinatorial Analysis site.

MIT 18.314 Combinatorial Analysis Related Textbooks
MIT 18.314 Combinatorial Analysis On The Web
Combinatorial Analysis
Tags
creative license combinatorial by-nc-sa massachusetts institute of technology creative commons

© Copyright 2015