Skip to main content
Log in

Maximum-sized antichains in minimal posets

  • Published:
algebra universalis Aims and scope Submit manuscript

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.

References

  1. G.Birkhoff,Lattice Theory, Amer. Math. Soc. Colloq. Publ. 25, Third Edition (1967).

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

    Google Scholar 

  3. R. P.Dilworth,Some combinatorial problems on partially ordered sets, Combinatorial Analysis (Proc. Symp. Appl. Math.), Amer. Math. Soc. (1960), 85–90.

  4. R. Freese,An application of Dilworth's lattice of maximal antichains, Discrete Math.7 (1974), 107–109.

    Google Scholar 

  5. G.Gratzer,General Lattice Theory, Academic Press (1978).

  6. G. Greene andD. J. Kleitman,Proof techniques in the theory of finite sets, Studies in Combinatorics (G. C. Rota), MAA Studies in Math.17 (1978), 22–79.

    Google Scholar 

  7. K. M. Koh,On the lattice of maximum-sized antichains of a finite poset, Algebra Universalis17 (1983), 73–86.

    Google Scholar 

  8. D. B. West,Extremal problems in partially ordered sets, Ordered sets (Banff, Alta., 1981), Reidel, Dordrecht (1982) 473–521.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koh, K.M. Maximum-sized antichains in minimal posets. Algebra Universalis 20, 217–228 (1985). https://doi.org/10.1007/BF01278599

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Navigation