Poset Enumeration

Poset Enumeration is a method in enumerative combinatorics that systematically counts the number of linear extensions or other combinatorial structures associated with a partially ordered set, distinguished by its focus on the intrinsic order relations and their quantitative enumeration.

46

Publications

1.2K

Citations

89

Authors

76

Institutions

Publications per year

2017–2026

2

Authors

89

  1. CD
    Constantinos Daskalakis

    Massachusetts Institute of Technology, United States

    3 publications · 82 citations

    3

    h-index

  2. WT
    William T. Trotter

    University of South Carolina, United States

    3 publications · 47 citations

    3

    h-index

  3. RM
    Richard M. Karp

    University of California, Berkeley, United States

    3 publications · 82 citations

    3

    h-index

  4. EM
    Elchanan Mossel

    University of California, Berkeley, United States

    3 publications · 82 citations

    3

    h-index

  5. EV
    Elad Verbin

    Tsinghua University, China

    3 publications · 82 citations

    3

    h-index

1–5 of 89

Venues

  1. Order

    6 publications · 88 citations

    6

    h-index

  2. Journal of Combinatorial Theory Series A

    4 publications · 251 citations

    4

    h-index

  3. Discrete Mathematics

    4 publications · 85 citations

    4

    h-index

  4. European Journal of Combinatorics

    3 publications · 103 citations

    3

    h-index

  5. The Electronic Journal of Combinatorics

    3 publications · 38 citations

    3

    h-index

1–5