Tag Archives: Shana Tova

Extremal Combinatorics III: Some Basic Theorems

. Shattering Let us return to extremal problems for families of sets and describe several basic theorems and basic open problems. In the next part we will discuss a nice proof technique called “shifting” or “compression.” The Sauer-Shelah (-Perles -Vapnik-Chervonenkis) Lemma: (Here we write .) … Continue reading

Posted in Combinatorics, Open problems | Tagged , | 8 Comments