The Fastest Way to Become a Backend Developer Online
Build GenAI Apps from Scratch — UCSB PaCE Certificate Program
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 a mathematics seminar presentation that delves into the fascinating world of regular subgraphs and their discovery methods. Learn about the historical progression from Erdős and Sauer's 1975 question through Pyber's 1985 breakthrough to recent developments by Janzer and Sudakov. Understand the comprehensive framework for finding regular subgraphs across all possible r-values, incorporating algebraic techniques from Alon, Friedland and Kalai, recent advances in the sunflower conjecture, and methods for identifying almost-regular subgraphs. Discover a novel random process that efficiently locates nearly regular subgraphs within almost-regular graphs, presented through collaborative research with Debsoumya Chakraborti, Oliver Janzer and Abhishek Methuku. Gain insights into why finding regular subgraphs is valuable, particularly when proving theorems or working with regular graphs.
Syllabus
10:30am|Simonyi Hall 101 and Remote Access
Taught by
Institute for Advanced Study