Tag Archives: Shana Tova

Extremal Combinatorics III: Some Basic Theorems

Posted on September 28, 2008 by Gil Kalai

. 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 →

	Avinoam Mann on To cheer you up in difficult t…
	Gil Kalai on To cheer you up in difficult t…
	Avinoam Mann on To cheer you up in difficult t…
	To cheer you up in d… on @HUJI
	To cheer you up in d… on To Cheer You Up in Difficult T…
	55 Best Computer Sci… on Possible future Polymath proje…
	Understanding The Ma… on TYI 30: Expected number of Dic…
	Gil Kalai on To cheer you up in difficult t…
	Gil Kalai on Nostalgia corner: John Riordan…
	Polymath projects 20… on Possible future Polymath proje…
	Gil Kalai on Chess can be a Game of Lu…
	Steve on Nostalgia corner: John Riordan…

Tag Archives: Shana Tova

Extremal Combinatorics III: Some Basic Theorems

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives