‘18.212: Algebraic Combinatorics’

Table of contents

  1. Course Info
  2. Realistic Prerequisites
  3. Subject Matter
  4. Course Staff
  5. Lectures
  6. Problem Sets
  7. Exams
  8. Resources
  9. Grading
  10. Advice to Future Students

Course Info

Class Size 87
Hours/Week 7.6 (27 responses)
Instructors Alexander Postnikov
Overall Rating 5.2/7.0

Realistic Prerequisites

  • Most thought that proof-writing (6.120, 6.121, etc.) was a helpful prerequisite.

Subject Matter

  • Most said that the class was broad, theoretical, disconnected, but interesting.

Course Staff

  • Most students said that the professor was very friendly and lenient with extensions.


  • Some students believed that lectures were decently paced, though rushed at the end.
  • Most students learned from a combination of lecture, official lecture notes, and/or Andrew Lin’s 18.212 notes.

Problem Sets

  • Challenging.
  • Most students said that the problem sets required creativity and collaboration.
  • Class had 3 problem sets of 6-7 problems, with some bonus questions.


  • No exams.


  • Official lecture notes were helpful, but sometimes outdated.
  • Online lecture notes (such as Andrew Lin’s) were helpful resource.


  • Students felt that grading was opaque but lenient.
  • Doing all the required problems was equivalent to get an A.

Advice to Future Students

  1. ”Take this class if you like thinking about combinatorics and love collecting ‘great ideas’; this class is full of them.”