Skip to main content
Log in

The length, the width and the cutset-number of finite ordered sets

  • Published:
Order Aims and scope Submit manuscript

Abstract

The partially ordered set P is an (α, β, γ) ordered set if the width of P≥α, the length of any chain of P≤β and the cut-set number ≤γ. We will prove that if P is an (α, β, γ) ordered set then P contains a ‘simple’ (α, β, γ) ordered set and use this result to prove that if P has the 3 cutset property, then width of P ≤ length of P+3.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J. Bell and J. Ginsburg, Compact spaces and spaces of maximal complete subgraphs, Trans. AMS (to appear).

  2. R. P.Dilworth (1950) A decomposition theorem for partially ordered sets, Ann. Math. 51, 161–166.

    Google Scholar 

  3. J. Ginsburg, I. Rival, and G. W. Sands, Antichains and finite sets that meet all maximal chains (to appear).

  4. N.Sauer and R.Woodrow (1984), Finite cutsets and finite antichains, Order 1, 35–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by I. Rival

Rights and permissions

Reprints and permissions

About this article

Cite this article

El-Zahar, M., Sauer, N. The length, the width and the cutset-number of finite ordered sets. Order 2, 243–248 (1985). https://doi.org/10.1007/BF00333129

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00333129

AMS (MOS) subject classification (1980)

Key words

Navigation