Learn about graph theory applications through a lecture from MIT's Probabilistic Methods in Combinatorics course that demonstrates how to prove the crossing number inequality in graph drawings using probabilistic methods, delivered by Professor Yufei Zhao in an 18-minute exploration of this fundamental concept in combinatorial mathematics.
Related Courses
-
Existence of Graphs with High Girth and High Chromatic Number
-
Graph Theory and Additive Combinatorics
-
Extremal Set Theory - Sperner's Theorem
-
Discrete Mathematics for CS
-
Extremal Set Theory - Intersecting Families and the Erdős-Ko-Rado Theorem
-
Lower Bounds to Ramsey Numbers - MIT 18.226 Probabilistic Methods in Combinatorics
