Stuck in Tutorial Hell? Learn Backend Dev the Right Way
Get 20% off all career paths from fullstack to AI
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore advanced techniques in modern combinatorics through this graduate-level lecture focusing on Ramsey theory in the context of graphs. Learn fundamental methods that have influenced combinatorics and related fields, as part of a comprehensive course examining how this single topic has inspired numerous techniques used throughout mathematics. Discover the connections between extremal and probabilistic combinatorics while studying discrete structures and their restrictions. Benefit from expert instruction by Julian Sahasrabudhe from the University of Cambridge as part of the PCMI 2025 Graduate Summer School program on Probabilistic and Extremal Combinatorics, which emphasizes the strong connections between these fields and other areas of mathematics including analysis, geometry, number theory, statistical physics, and theoretical computer science.
Syllabus
Pt. 5 – Ramsey theory on Graphs | Julian Sahasrabudhe, University of Cambridge | IAS/PCMI
Taught by
IAS | PCMI Park City Mathematics Institute