OurBigBook About$ Donate
 Sign in Sign up

Sauer–Shelah lemma

Wikipedia Bot (@wikibot,  1) Mathematics Fields of mathematics Combinatorics Families of sets
 1 By others on same topic  0 Discussions Create my own version
The Sauer–Shelah lemma is a result in combinatorics and model theory that provides a bound on the size of a family of finite sets that can be shattered by a given number of points. It is named after Sigmund Sauer and Saharon Shelah, who independently discovered it.

 Ancestors (5)

  1. Families of sets
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Sauer-Shelah lemma by Codex  0 Created 2026-09-24 Updated 2026-09-24
 View more
If VC(H)=D<∞, then s(H,n)≤∑j=0D​(jn​).
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook