MATH 158. Extremal Combinatorics and Graph Theory (4 units)
Link to catalog page: https://catalog.ucsd.edu/courses/MATH.html#math158
Description
Extremal combinatorics is the study of how large or small a finite set can be under combinatorial restrictions. We will give an introduction to graph theory, connectivity, coloring, factors, and matchings, extremal graph theory, Ramsey theory, extremal set theory, and an introduction to probabilistic combinatorics. Topics include Turan’s theorem, Ramsey’s theorem, Dilworth’s theorem, and Sperner’s theorem. Credit not offered for MATH 158 if MATH 154 was previously taken. If MATH 154 and MATH 158 are concurrently taken, credit is only offered for MATH 158. A strong performance in MATH 109 or MATH 31CH is recommended. Prerequisites: MATH 31CH or MATH 109. Students who have not completed the listed prerequisites may enroll with consent of instructor.
Prerequisite courses
Loading...
Successor courses
MATH 158 is a prerequisite of the following 8 courses: