Главная
Study mode:
on
1
Intro
2
What is Extremal Combinatorics All About?
3
Guiding Problem 2
4
The Brown-Erdos-Sós Conjecture
5
Approximate Brown-Erdős-Sós Conjecture
6
Two Competing Conjectures
7
Hypergraphs without Grids
8
Deriving the Removal Lemma from Regularity Lemma
9
Bounds for Removal Lemma
10
The Hypergraph Removal Lemma
11
A Tight Lower Bound for Hypergraph Regularity
12
A Tight Upper Bound for Regularity with Modificatio
13
Almost Monochromatic Sets
14
Variants of the Removal Lemma
15
An Infinite Removal Lemma
16
Removal Lemmas with Polynomial Bounds
17
Removal Lemmas with Prescribed Growth
18
A Generalized Turán Problem
Description:
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.

Asaf Shapira - Local vs Global Combinatorics

International Mathematical Union
Add to list