### 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

- Mathematics/Combinatorics

### Session Sunflowers

- Sunflower
- Erdos_Rado_Sunflower

### Used by

- Clique is not solvable by monotone circuits of polynomial size

## Cite

×

Sunflowers-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Mar 1, 2021 : Isabelle2021