MATH 39A: Introduction to Combinatorics

Instructor: Theo Douvropoulos

Prerequisites: COSI 29a or MATH 23b, or permission of the instructor.

Course Description: Topics include graph theory (trees, planarity, coloring, Eulerian and Hamiltonian cycles), combinatorial optimization (network flows, matching theory), enumeration (permutations and combinations, generating functions, inclusion-exclusion), and extremal combinatorics (pigeonhole principle, Ramsey's theorem).

Session: Session I

Day: M, T, Th

Time: 11:10am - 1:40pm

Credit Hours: 4 Credits

Course Format: Remote Learning Course for Summer 2024

Brandeis Graduation Requirement Fulfilled: SN

Enrollment Limit:

Course Classification:

Course Tuition: $3,700

Course Fees: None

Open to High School Students: No

Instructor Biography

Course Syllabus