Skip to main content
SpringerLink
Log in

Counting finite posets

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Berge,Principles of Combinatorics, Academic Press(New York, 1971).

    Google Scholar 

  2. G. Birkhoff,Lattice Theory, Am. Math. Soc., Colloquium Publications 25, 3rd Ed. (Providence, R. I., 1967).

  3. K. K-H. Butler, The number of partially ordered sets,J. Combinational Theory. 13 (1972), 276–289.

    Google Scholar 

  4. K. K-H. Butler andG. Markovsky, The number of partially ordered sets II,J. Korean Math. Soc.,11 (1974), 7–17.

    Google Scholar 

  5. D. Klarner, The number of graded partially ordered sets,J. Combinatorial Theory,6 (1969). 12–19.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of mathematics, The University of Alabama, 35 486, University, Alabama, USA

    J. Neggers

Authors
  1. J. Neggers
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neggers, J. Counting finite posets. Acta Mathematica Academiae Scientiarum Hungaricae 31, 233–258 (1978). https://doi.org/10.1007/BF01901974

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation