Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Mirsky's_theorem> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Mirsky's_theorem 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 (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 monotonic subsequences.".
- Mirsky's_theorem wikiPageID "28848438".
- Mirsky's_theorem wikiPageRevisionID "529489618".
- Mirsky's_theorem authorlink "Leon Mirsky".
- Mirsky's_theorem first "Leon".
- Mirsky's_theorem hasPhotoCollection Mirsky's_theorem.
- Mirsky's_theorem last "Mirsky".
- Mirsky's_theorem year "1971".
- Mirsky's_theorem subject Category:Articles_containing_proofs.
- Mirsky's_theorem subject Category:Order_theory.
- Mirsky's_theorem subject Category:Perfect_graphs.
- Mirsky's_theorem subject Category:Theorems_in_combinatorics.
- Mirsky's_theorem 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.".
- Mirsky's_theorem label "Mirsky's theorem".
- Mirsky's_theorem sameAs m.0kvg1b3.
- Mirsky's_theorem sameAs Q6874717.
- Mirsky's_theorem sameAs Q6874717.
- Mirsky's_theorem wasDerivedFrom Mirsky's_theorem?oldid=529489618.
- Mirsky's_theorem isPrimaryTopicOf Mirsky's_theorem.