MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024 - Large Bipartite Subgraph

MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024 Instructor: Yufei Zhao View the complete course: https://ocw.mit.edu/courses/18-226-probabilistic-methods-in-combinatorics-fall-2022/ YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61cYB5ymvFiEbIb-wWHfaqO A simple application of the probabilistic method in combinatorics: a proof that every graph contains a large bipartite subgraph with at least half of the edges. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu Support OCW at http://ow.ly/a1If50zVRlQ We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.