The number of graded partially ordered sets

D.A. Klarner

    Research output: Contribution to journalArticleAcademicpeer-review

    18 Citations (Scopus)
    1 Downloads (Pure)

    Abstract

    We find an explicit formula for the number of graded partially ordered sets of rank h that can be defined on a set containing n elements. Also, we find the number of graded partially ordered sets of length h, and having a greatest and least element that can be defined on a set containing n elements. The first result provides a lower bound for G*(n), the number of posets that can be defined on an n-set; the second result provides an upper bound for the number of lattices satisfying the Jordan-Dedekind chain condition that can be defined on an n-set.
    Original languageEnglish
    Pages (from-to)12-19
    Number of pages8
    JournalJournal of Combinatorial Theory
    Volume6
    Issue number1
    DOIs
    Publication statusPublished - 1969

    Fingerprint

    Dive into the research topics of 'The number of graded partially ordered sets'. Together they form a unique fingerprint.

    Cite this