MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024
5.0
(0)
10 learners
What you'll learn
This course includes
- 3.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 11 lessons • 3.5 hours of video
MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024
11 lessons
• 3.5 hours
MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024
11 lessons
• 3.5 hours
- Large Bipartite Subgraph 06:44
- Lower Bounds to Ramsey Numbers 43:07
- Extremal Set Theory: Sperner's Theorem 12:49
- Extremal Set Theory: Intersecting Families 17:20
- Linearity of Expectations 12:55
- Independent Sets and Turán's Theorem 14:52
- Crossing Number Inequality 18:26
- Markov, Chebyshev, and Chernoff 16:30
- Bounded Differences Inequality (aka Azuma-Hoeffding Inequality) 19:47
- Threshold for a Random Graph to Contain a Triangle 28:52
- Existence of Graphs with High Girth and High Chromatic Number 25:19
Take this course with you
Download the app to continue lessons from your phone anytime.
