Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about the fundamental concepts of extremal set theory through a 13-minute mathematics lecture that explores Sperner's Theorem, a key result in combinatorics. Discover how the probabilistic method can be applied to determine the maximum number of subsets possible from an n-element set without any subset containing another. Follow along as Professor Yufei Zhao from MIT's Probabilistic Methods in Combinatorics course demonstrates this important principle in combinatorial mathematics, providing insights into set theory relationships and mathematical reasoning.
Syllabus
Extremal Set Theory: Sperner's Theorem
Taught by
MIT OpenCourseWare