About: Mirsky's theorem

An Entity of Type: WikicatTheoremsInCombinatorics, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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 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 monotonic subsequences.

Property Value
dbo:abstract
  • 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 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 monotonic subsequences. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 28848438 (xsd:integer)
dbo:wikiPageLength
  • 8752 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032031060 (xsd:integer)
dbo:wikiPageWikiLink
dbp:authorlink
  • Leon Mirsky (en)
dbp:first
  • Leon (en)
dbp:last
  • Mirsky (en)
dbp:wikiPageUsesTemplate
dbp:year
  • 1971 (xsd:integer)
dcterms:subject
rdf:type
rdfs:comment
  • 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 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 monotonic subsequences. (en)
rdfs:label
  • Mirsky's theorem (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License