LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Extremal Set Theory: Intersecting Families
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Extremal Set Theory: Intersecting Families

17 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Probabilistic Methods in Combinatorics · LECTURE 4

Yufei Zhao continues MIT's 18.226 Probabilistic Methods in Combinatorics with a session on extremal set theory. The central question: given an n-element set, how large can a family of k-element subsets be if every pair of subsets must intersect? Zhao builds toward the Erdos-Ko-Rado theorem, which pins down the exact maximum size of such an intersecting family, and shows how probabilistic arguments give a clean proof alongside the classical combinatorial one. The lecture fits into the course's broader project of using randomness and probability as tools to settle counting and extremal problems that resist purely combinatorial attack. Expect blackboard-style derivation, precise definitions of shifting and compression techniques where relevant, and a tight focus on one theorem worked through carefully rather than a survey of many results.

At a glance

Lecture facts

Runtime compared with the other 734 Mathematics lectures
Runtime17 m
Compared with MathematicsShorter than 98%
This series

Probabilistic Methods in Combinatorics

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 3 of 956 m before this · 3 h 13 m in total

More from this course

8 LECTURES
Lower Bounds to Ramsey Numbers

Lower Bounds to Ramsey Numbers

MIT · 43 MIN
Extremal Set Theory: Sperner's Theorem

Extremal Set Theory: Sperner's Theorem

MIT · 13 MIN
Linearity of Expectations

Linearity of Expectations

MIT · 13 MIN
Independent Sets and Turán's Theorem

Independent Sets and Turán's Theorem

MIT · 15 MIN
Crossing Number Inequality

Crossing Number Inequality

MIT · 18 MIN
Bounded Differences Inequality (Azuma-Hoeffding Inequality)

Bounded Differences Inequality (Azuma-Hoeffding Inequality)

MIT · 20 MIN
Threshold for a Random Graph to Contain a Triangle

Threshold for a Random Graph to Contain a Triangle

MIT · 29 MIN
Existence of Graphs with High Girth and High Chromatic Number

Existence of Graphs with High Girth and High Chromatic Number

MIT · 25 MIN