18.226 | Fall 2022 | Graduate

Probabilistic Methods in Combinatorics

Existence of Graphs with High Girth and High Chromatic Number

Application of the probabilistic method in combinatorics to graph theory. Proof of a classic and ingenious result of Erdős that there exists a graph with arbitrarily high girth and chromatic number.

Course Info

Instructor
Departments
As Taught In
Fall 2022
Level
Graduate
Topics
Learning Resource Types
Instructor Insights
Online Textbook
Lecture Notes
Lecture Videos
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2025 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2025 Massachusetts Institute of Technology