MATH 4410 — Introduction to Combinatorics I
General Information
Combinatorics studies discrete structures arising in mathematics, computer science, and many areas of application. Key topics include counting objects with specific properties (e.g., trees) and proving the existence of structures (e.g., matchings of all vertices in a graph). We cover basic questions in graph theory, including extremal graph theory (how large a graph must be to have a certain subgraph) and Ramsey theory (large objects are forced to have structure). An introduction to network flow theory and variations on matching theory, including theorems of Dilworth, Hall, König, and Birkhoff, are discussed.
Full Cornell course description (FA26)
Credits: 4
Prerequisites and Enrollment
Prerequisites: MATH 2210 or MATH 2230 or MATH 2310 or MATH 2940 or equivalent.
Recorded Offerings
| Semester | Listed instructors | Course details |
|---|---|---|
| Fall 2026 | Victor Souza | Roster / syllabus |
Workload and General Advice
Student contributions have not been added yet. Consult the offering’s syllabus for assignments and assessment details.
Student Experiences
No testimonials yet.
Course information checked against Cornell’s Spring and Fall 2026 rosters on September 18, 2026. The listed semesters are verified examples, not a complete offering history.