Well-partial Orders

Well-Partial Orders is a type of partial order in which every infinite sequence of elements contains a pair that is comparable, thereby ensuring the absence of infinite antichains and infinite strictly decreasing sequences.

18

Publications

810

Citations

24

Authors

25

Institutions

Publications per year

2017–2026

0

Variants

Well-partial OrderingsWpos

Authors

24

  1. MR
    Michael R. Fellows

    University of Victoria, Canada

    3 publications · 210 citations

    3

    h-index

  2. MA
    Michael A. Langston

    University of Tennessee at Knoxville, United States

    2 publications · 189 citations

    2

    h-index

  3. RR
    R. Rado

    University Foundation, Belgium

    2 publications · 108 citations

    2

    h-index

  4. DH
    David Haussler

    University of California, Santa Cruz, United States

    2 publications · 39 citations

    2

    h-index

  5. VV
    Vincent Vatter

    University of St Andrews, United Kingdom

    2 publications · 72 citations

    2

    h-index

1–5 of 24

Venues

  1. Order

    2 publications · 57 citations

    3

    h-index

  2. Discrete Mathematics

    2 publications · 59 citations

    2

    h-index

  3. Theoretical Computer Science

    1 publications · 27 citations

    1

    h-index

  4. Journal of the London Mathematical Society

    1 publications · 16 citations

    1

    h-index

  5. The Electronic Journal of Combinatorics

    1 publications · 44 citations

    1

    h-index

1–5