Ranked poset
id:
ranked-poset-290-13877593
title:
Ranked poset
text:
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, or
a poset in which all maximal chains have the same finite length. The second definition differs from the first in that it requires all minimal elements to have the same rank; for posets with a least element, howe
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Ranked_poset
date created:
date modified:
2023-10-24T21:41:36Z
main entity:
{"identifier":"Q16964327","url":"https://www.wikidata.org/entity/Q16964327"}
image:
fields total:
13
integrity:
13