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
Learning Resource Types
Instructor Insights
notes
Lecture Notes
theaters
Lecture Videos
menu_book
Open Textbooks
assignment
Problem Sets
