Mirsky's theorem
id:
mirsky-s-theorem-322-12881261
title:
Mirsky's theorem
text:
In mathematics, in the areas of order theory and combinatorics, Mirsky's theorem characterizes the height of any finite partially ordered set in terms of a partition of the order into a minimum number of antichains. It is named for Leon Mirsky (1971) and is closely related to Dilworth's theorem on the widths of partial orders, to the perfection of comparability graphs, to the Gallai–Hasse–Roy–Vitaver theorem relating longest paths and colorings in graphs, and to the Erdős–Szekeres theorem on mon
brand slug:
wiki
category slug:
encyclopedia
description:
Characterizes the height of any finite partially ordered set
original url:
https://en.wikipedia.org/wiki/Mirsky%27s_theorem
date created:
date modified:
2023-11-10T13:33:54Z
main entity:
{"identifier":"Q6874717","url":"https://www.wikidata.org/entity/Q6874717"}
image:
fields total:
13
integrity:
14