The Sunflower Lemma of Erdős and Rado

René Thiemann 📧

February 25, 2021

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

We formally define sunflowers and provide a formalization of the sunflower lemma of Erdős and Rado: whenever a set of size-k-sets has a larger cardinality than (r - 1)k · k!, then it contains a sunflower of cardinality r.

License

BSD License

Topics

Session Sunflowers

Used by

Cite

× 
@article{Sunflowers-AFP,
  author  = {René Thiemann},
  title   = {The Sunflower Lemma of Erdős and Rado},
  journal = {Archive of Formal Proofs},
  month   = {February},
  year    = {2021},
  note    = {\url{https://isa-afp.org/entries/Sunflowers.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: