OurBigBook About$ Donate
 Sign in Sign up

Ray-Chaudhuri–Wilson theorem

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Extremal set theory Frankl-Wilson theorem
2026-09-28  0 By others on same topic  0 Discussions Create my own version
If a k-uniform set family on an n-element ground set has at most s possible intersection sizes between distinct members, then its size is at most (sn​). The proof uses the linear independence of incidence polynomials on the k-slice.

 Ancestors (6)

  1. Frankl-Wilson theorem
  2. Extremal set theory
  3. Combinatorics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 109 / 4 / iii / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 109 / 4 / i / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2022 / iii / Paper 109 / 4 / iv / 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