MIT · Mathematics & Statistics
18.226 Probabilistic Methods in Combinatorics
Yufei Zhao · 2022 · 11 free video lectures
This course is a graduate-level introduction to the probabilistic methods, a fundamental and powerful technique in combinatorics and theoretical computer science. The essence of the approach is to show that some combinatorial object exists and prove that a certain random construction works with…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- 18226 large bipartite subgraph_mp4
- 18226 lower bounds to ramsey numbers_mp4
- 18226 extremal set theory sperners theorem_mp4
- 18226 extremal set theory intersecting families_mp4
- 18226 linearity of expectations_mp4
- 18226 independent sets and turans theorem_mp4
- 18226 crossing number inequality_mp4
- 18226 markov chebyshev and chernoff_mp4
- 18226 bounded differences inequality_mp4
- 18226 threshold for a random graph to contain a triangle_mp4
- 18226 existence of graphs with high girth and high chromatic number_mp4
From MIT OpenCourseWare · CC BY-NC-SA 4.0. More from MIT.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights