Skip to main content
SpringerLink
Log in
Book cover

Extremal Combinatorics pp 109–132Cite as

Blocking Sets and the Duality

  • Chapter

  • 369 Accesses

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

In this chapter we will consider one of the most basic properties of set systems — their duality.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

  1. Informatik - FB 20, Theoretische Informatik, Johann Wolfgang Goethe-Universität, Robert-Mayer-Str. 11-15, 60235, Frankfurt, Germany

    Dr. Stasys Jukna

  2. Institute of Mathematics and Informatics, Akademijos 4, 2600, Vilnius, Lethuania

    Dr. Stasys Jukna

Authors
  1. Dr. Stasys Jukna
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jukna, S. (2001). 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-662-04650-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04650-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08559-8

  • Online ISBN: 978-3-662-04650-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation