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.
Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
