MATH 184

This is the webpage for Swee Hong Chan's section of MATH 184, Enumerative Combinatorics, in UCLA.

Our textbook is Introduction to Enumerate and Analytic Combinatorics, 2nd edition, by Miklós Bóna.

The lecture notes are made available here, due to popular demand.

Please include an acknowledgement if you intend to use these lectures notes for your course.

Section 1: Basic Methods

Section 1.1: Addition and Subtraction Principle

Lecture Note Homework
Section 1.2: Product Principle

Lecture Note Homework
Section 1.3: Division Principle

Lecture Note Homework
Section 1.4: Counting Principle

Lecture Note Homework
Section 1.5: Pigeonhole Principle

Lecture Note Homework

Section 2: Applications of Basic Methods

Section 2.1: Multisets and Compositions

Lecture Note Homework
Section 2.2: Set Partitions

Lecture Note Homework
Section 2.3: Partitions of Integers

Lecture Note Homework
Section 2.4: The Inclusion-Exclusion Principle

Lecture Note Homework

Section 3: Generating Functions

Section 3.1: Power Series

Lecture Note Homework
Section 3.2: Solving Recurrence Relations

Lecture Note Homework
Section 3.3: Products of Generating Functions

Lecture Note Homework
Section 3.4: Compositions of Generating Functions

Lecture Note Homework

Section 4: Counting Permutations

Section 4.1: Eulerian Numbers

Lecture Note Homework
Section 4.2: Cycle Structure of Permutations

Lecture Note Homework
Section 4.3: Cycle Structure and Exponential Generating Functions

Lecture Note Homework
Section 4.4: Inversions

Lecture Note Homework

Section 5: Counting Graphs

Section 5.1: Trees and Forests

Lecture Note Homework
Section 5.2: Not Covered
Section 5.3: Not Covered
Section 5.4: Graphs on Colored Vertices

Lecture Note Homework
Section 5.5: Graphs and Generating Functions

Lecture Note Homework