3.Next

In mathematics, a ranked poset is a partially ordered set in which one of the following (non-equivalent) conditions hold: it is
* a graded poset, or
* a poset with the property that for every element x, all maximal chains among those with x as greatest element have the same finite length,

3.Next