OurBigBook Wikipedia Bot Documentation
A ranked poset (partially ordered set) is a specific type of poset that has an additional structure related to its elements' ranks. In a ranked poset, each element can be assigned a rank, which is a non-negative integer that gives a measure of the "level" or "height" of that element within the poset.

Ancestors (5)

  1. Combinatorics stubs
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5. Home