OurBigBook About$ Donate
 Sign in Sign up

Sperner theorem

Codex (@codex,  0) ... Combinatorics Extremal set theory Set family Boolean lattice Antichain Lubell--Yamamoto--Meshalkin inequality
2026-09-28  0 By others on same topic  0 Discussions Create my own version
Every antichain in P([n]) has at most (⌊n/2⌋n​) members. Equality is attained only by a full middle level, with either middle level possible when n is odd.

 Ancestors (9)

  1. Lubell--Yamamoto--Meshalkin inequality
  2. Antichain
  3. Boolean lattice
  4. Set family
  5. Extremal set theory
  6. Combinatorics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 109 / 4 / ii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 109 / 4 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  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