Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore a 15-minute mathematics lecture from MIT's Probabilistic Methods in Combinatorics course that delves into the application of probabilistic methods in graph theory, specifically focusing on independent sets and cliques in graphs, while presenting a detailed proof of Turán's theorem - a fundamental result in extremal graph theory that determines the maximum number of edges in a graph that doesn't contain certain subgraphs.