Learn · Probabilistic Methods in Combinatorics
Lecture 6 of 11Lecture Videos
Independent Sets and Turán's Theorem
Prof. Yufei Zhao · Massachusetts Institute of Technology
Credits and licence
- From
- Probabilistic Methods in Combinatorics, Massachusetts Institute of Technology (at MIT OpenCourseWare)
- Licence
- CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only.
- Attribution
- Prof. Yufei Zhao. Probabilistic Methods in Combinatorics. Fall 2022. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Large Bipartite Subgraph
- Lower Bounds to Ramsey Numbers
- Extremal Set Theory: Sperner's Theorem
- Extremal Set Theory: Intersecting Families
- Linearity of Expectations
- Independent Sets and Turán's Theorem
- Crossing Number Inequality
- Markov, Chebyshev, and Chernoff
- Bounded Differences Inequality (aka Azuma-Hoeffding Inequality)
- Threshold for a Random Graph to Contain a Triangle
- Existence of Graphs with High Girth and High Chromatic Number