Abstract
In this chapter we will consider one of the most basic properties of set systems — their duality. The dual of a family \(\mathcal{F}\) consists of all (minimal under set-inclusion) sets that intersect all members of \(\mathcal{F}\). Dual families play an important role in many applications, boolean function complexity being just one example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2011). Blocking Sets and the Duality. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-17364-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17363-9
Online ISBN: 978-3-642-17364-6
eBook Packages: Computer ScienceComputer Science (R0)