Extremal Combinatorics Courses and Certifications

IAS | PCMI Park City Mathematics Institute

Asymptotic Enumeration via Graph Containers and Entropy - Part 3

Explore advanced graph container methods and entropy techniques for asymptotic enumeration problems in extremal and probabilistic combinatorics.

• YouTube
• 51 minutes
• On-Demand
• Free Video

Simons Institute

Applications in Extremal Combinatorics - Lecture 2

Explore advanced concepts in extremal combinatorics, focusing on analytical techniques and their applications in theoretical computer science.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

Simons Institute

Applications in Extremal Combinatorics - Lecture 1

Explore advanced concepts in extremal combinatorics, focusing on analytical techniques and their applications in theoretical computer science.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

Simons Institute

Representation Theory in TCS and Extremal Combinatorics

Explore how Representation Theory extends Boolean function theory, leading to new insights in theoretical computer science and extremal combinatorics.

• YouTube
• 51 minutes
• On-Demand
• Free Video

IAS | PCMI Park City Mathematics Institute

Machine Learning and Pure Math - Especially Extremal Combinatorics

Explore how machine learning techniques can solve complex problems in extremal combinatorics, from constructing large capsets to finding graphs with specific properties.

• YouTube
• 58 minutes
• On-Demand
• Free Video

Institute for Advanced Study

Quasipolynomial Bounds for Some Problems in Extremal Combinatorics

Explore quasipolynomial bounds in extremal combinatorics with Zander Kelley, examining key problems and recent advancements in this mathematical field.

• YouTube
• 17 minutes
• On-Demand
• Free Video

International Centre for Theoretical Sciences

Additive Number Theory - Extremal Problems and the Combinatorics of Sumsets by M. Nathanson

Explore extremal problems and combinatorics of sumsets in additive number theory, covering density, lower bounds, Cauchy-Davenport theorem, and Erdos-Turan conjecture.

• YouTube
• 50 minutes
• On-Demand
• Free Video

Hausdorff Center for Mathematics

The Mysterious Extremals of the Alexandrov-Fenchel Inequality

Explore the Alexandrov-Fenchel inequality's extremal bodies, recent progress in characterizing them for convex polytopes, and insights into this fundamental problem in convex geometry.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

International Mathematical Union

Asaf Shapira - Local vs Global Combinatorics

Explore extremal combinatorics through the Brown-Erdős-Sós conjecture, hypergraph theory, and removal lemmas. Gain insights into local-global principles and their applications in mathematics.

• YouTube
• 46 minutes
• On-Demand
• Free Video

BIMSA

Graph Limits and Homomorphism Density Inequalities

Explore graph limits theory, homomorphism density inequalities, and their applications in extremal combinatorics. Gain insights into undecidability and randomness in graph theory.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

BIMSA

Hamiltonicity of Expanders: Optimal Bounds and Applications

Explore optimal bounds and applications of Hamiltonicity in expanders with Nemanja Draganić, delving into extremal and probabilistic combinatorics, Ramsey theory, and theoretical computer science.

• YouTube
• 1 hour 2 minutes
• On-Demand
• Free Video

BIMSA

Canonical Colourings in Random Graphs

Explore canonical colourings in random graphs with Nina Kamčev, delving into extremal combinatorics, Ramsey theory, and asymptotic enumeration.

• YouTube
• 51 minutes
• On-Demand
• Free Video

BIMSA

Recent Progress on the Erdos-Hajnal Conjecture

Explore recent advancements in the Erdos-Hajnal Conjecture with Oxford mathematician Alexander Scott, delving into extremal and probabilistic combinatorics and structural graph theory.

• YouTube
• 1 hour 3 minutes
• On-Demand
• Free Video

BIMSA

Hypergraph Decompositions and Their Applications

Explore hypergraph decompositions and their applications in combinatorics with Oxford Professor Peter Keevash, known for solving the Existence Conjecture for Combinatorial Designs.

• YouTube
• 1 hour 1 minute
• On-Demand
• Free Video

BIMSA

Rainbow Thresholds in Graph Theory

Explore extremal combinatorics, graph theory, and theoretical computer science with Prof. Jie Han's insights on rainbow thresholds in mathematics.

• YouTube
• 55 minutes
• On-Demand
• Free Video