Dilworth's Theorem

Dilworth's Theorem is a fundamental result in order theory stating that in any finite partially ordered set, the size of a maximum antichain equals the minimum number of chains needed to partition the set.

52

Publications

2.5K

Citations

96

Authors

48

Institutions

Publications per year

2017–2026

1

Authors

96

  1. JW
    Junzo Watanabe

    Tokai University, Japan

    3 publications · 170 citations

    3

    h-index

  2. RA
    Richard A. Dean

    University of British Columbia, Canada

    2 publications · 60 citations

    2

    h-index

  3. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    2 publications · 78 citations

    2

    h-index

  4. CB
    C. Benzaken

    Translational Innovation in Medicine and Complexity, France

    2 publications · 41 citations

    2

    h-index

  5. DR
    D. R. Fulkerson

    RAND Corporation, United States

    2 publications · 158 citations

    2

    h-index

1–5 of 96

Venues

  1. Canadian Journal of Mathematics

    5 publications · 160 citations

    5

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 4 publications · 190 citations

    4

    h-index

  3. Order

    3 publications · 120 citations

    3

    h-index

  4. American Mathematical Monthly

    3 publications · 194 citations

    3

    h-index

  5. International Journal of Algebra and Computation

    IJAC · 3 publications · 449 citations

    3

    h-index

1–5