Abstract
One of most beautiful results in extremal set theory is the so-called Sunflower Lemma discovered by Erdős and Rado (1960) asserting that in a sufficiently large uniform family, some highly regular configurations, called “sunflowers,” must occur, regardless of the size of the universe. In this chapter we will consider this result as well as some of its modifications and applications.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2001). Sunflowers. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04650-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-04650-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08559-8
Online ISBN: 978-3-662-04650-0
eBook Packages: Springer Book Archive