Asaf Shapira - Local vs Global Combinatorics

YouTube·Graph Theory

Explore the fascinating world of extremal combinatorics in this 46-minute lecture by Asaf Shapira, presented by the International Mathematical Union. Delve into key concepts such as the Brown-Erdos-Sós Conjecture, hypergraphs without grids, and removal lemmas. Examine the interplay between local and global combinatorial properties, investigate tight bounds for hypergraph regularity, and discover variants of removal lemmas including infinite and polynomial-bounded versions. Gain insights into generalized Turán problems and the application of combinatorial techniques to solve complex mathematical challenges.