Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Jukna's book Extremal Combinatorics explains basic results about sunflowers. Is there a more thorough survey of various sunflower results?

share|cite|improve this question
"On Sunflowers and Matrix Multiplication". P.S. in order to avoid trivial answers (like mine :-) you should write in your question a list of papers/results you already have/know ... – Marzio De Biasi Sep 18 '12 at 9:42
its hard to beat jukna ("the surveyor") for surveys! fyi there are some new tighter ("quasi-")sunflower thms in b.rossmans Phd thesis & related paper – vzn Sep 18 '12 at 16:12
also apparently closely related, the erdos-ko-rado thm, proof eg here – vzn Sep 18 '12 at 18:13
the Hilton-Milner theorem complements EKR and shows that the maximum size of an intersecting family is only attained by the trivial sunflower with a single element in the common intersection – Sasho Nikolov Sep 19 '12 at 13:43

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.