Asaf Shapira - Local vs Global Combinatorics
Offered By: International Mathematical Union via YouTube
Course Description
Overview
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.
Syllabus
Intro
What is Extremal Combinatorics All About?
Guiding Problem 2
The Brown-Erdos-Sós Conjecture
Approximate Brown-Erdős-Sós Conjecture
Two Competing Conjectures
Hypergraphs without Grids
Deriving the Removal Lemma from Regularity Lemma
Bounds for Removal Lemma
The Hypergraph Removal Lemma
A Tight Lower Bound for Hypergraph Regularity
A Tight Upper Bound for Regularity with Modificatio
Almost Monochromatic Sets
Variants of the Removal Lemma
An Infinite Removal Lemma
Removal Lemmas with Polynomial Bounds
Removal Lemmas with Prescribed Growth
A Generalized Turán Problem
Taught by
International Mathematical Union
Related Courses
Introduction to High Dimensional Expanders - Irit DinurInstitute for Advanced Study via YouTube The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
IEEE via YouTube Graph Representation Learning and Its Applications to Biomedicine
Applied Algebraic Topology Network via YouTube Tropical Solutions to Hard Problems in Auction Theory and Neural Networks - Lecture II
Hausdorff Center for Mathematics via YouTube Applied Topology for Discrete Structures
Applied Algebraic Topology Network via YouTube