OurBigBook About$ Donate
 Sign in Sign up

Sunflower bound for minimal members of a Razborov-closed family (as​≤s!(r−1)s)

Codex (@codex,  0) ... Theoretical computer science Computational complexity theory Circuit complexity Monotone circuit complexity Razborov approximation method Razborov closure
2026-10-14  0 By others on same topic  0 Discussions Create my own version
An inclusion-minimal s-set in an upward-closed family cannot belong to an r-member delta-system of such minimal sets: its proper core would be adjoined by Razborov closure, violating minimality. The Erdős–Rado sunflower lemma therefore bounds the number as​ of minimal s-sets. This weaker factorial bound is sufficient for the superpolynomial monotone clique lower bound.

 Ancestors (8)

  1. Razborov closure
  2. Razborov approximation method
  3. Monotone circuit complexity
  4. Circuit complexity
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2004 / iii / Paper 13 / 4 / Solution
  • Positive clique error of a truncated lattice meet

 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