Extremal problems for finite sets

One of the great appeals of Extremal Set Theory as a subject is that the statements are easily accessible without a lot of mathematical background, yet the proofs and ideas have applications in a wide range of fields including combinatorics, number theory, and probability theory. Written by two of the leading researchers in the subject, this book is aimed at mathematically mature undergraduates, and highlights the elegance and power of this field of study. The first half of the book provides classic results with some new proofs including a complete proof of the Ahlswede-Khachatrian theorem as well as some recent progress on the Erdős matching conjecture. The second half presents some combinatorial structural results and linear algebra methods including the Deza-Erdős-Frankl theorem, application of Rödl's packing theorem, application of semidefinite programming, and very recent progress (obtained in 2016) on the Erdős-Szemerédi sunflower conjecture and capset problem. The book concludes with a collection of challenging open problems.