Skip to main content

Chains and Antichains

  • Chapter
Extremal Combinatorics

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

  • 5745 Accesses

Abstract

Partial ordered sets provide a common frame for many combinatorial configurations. Formally, a partially ordered set (or poset, for short) is a set P together with a binary relation < between its elements which is transitive and antysymmetric: if x<y and y<z then x<z, but x<y and y<x cannot both hold. We write xy if x<y or x=y. Elements x and y are comparable if either xy or yx (or both) hold.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stasys Jukna .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jukna, S. (2011). Chains and Antichains. In: Extremal Combinatorics. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17364-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17364-6_8

  • 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)

Publish with us

Policies and ethics