Set Partitions

Set Partitions is a combinatorial construct that consists of a decomposition of a given set into a collection of non-empty, pairwise disjoint subsets whose union is the original set.

212

Publications

33.9K

Citations

342

Authors

212

Institutions

Publications per year

2017–2026

23

Authors

342

  1. TM
    Toufik Mansour

    University of Haifa, Israel

    8 publications · 143 citations

    8

    h-index

  2. GE
    George E. Andrews

    Pennsylvania State University, United States

    5 publications · 150 citations

    5

    h-index

  3. MK
    Martin Klazar

    Charles University, Czechia

    4 publications · 223 citations

    4

    h-index

  4. MS
    Mark Shattuck

    University of Tennessee at Knoxville, United States

    4 publications · 55 citations

    4

    h-index

  5. PE
    P. Erdös

    Hungarian Academy of Sciences, Hungary

    4 publications · 320 citations

    4

    h-index

1–5 of 342

Venues

  1. Journal of Combinatorial Theory Series A

    18 publications · 849 citations

    15

    h-index

  2. The Electronic Journal of Combinatorics

    18 publications · 535 citations

    13

    h-index

  3. Discrete Mathematics

    11 publications · 283 citations

    10

    h-index

  4. European Journal of Combinatorics

    9 publications · 310 citations

    9

    h-index

  5. Proceedings of the American Mathematical Society

    PROC · 7 publications · 158 citations

    7

    h-index

1–5