Skip to main content
Log in

On the lattice of maximum-sized antichains of a finite poset

  • 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.), American 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, Pure and Applied Maths. Series, Academic Press (1978).

  6. C. 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. D. J. Kleitman, M. Edelberg andD. Lubell,Maximum sized antichains in partial orders, Discrete Math.1 (1971), 47–53.

    Google Scholar 

  8. D. B.West,Extremal problems in partially ordered sets, Proc. Symp. on Ordered Sets (1982).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koh, K.M. On the lattice of maximum-sized antichains of a finite poset. Algebra Universalis 17, 73–86 (1983). https://doi.org/10.1007/BF01194515

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Navigation