Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1134776> ?p ?o }
Showing triples 1 to 54 of
54
with 100 triples per page.
- Q1134776 subject Q7007192.
- Q1134776 subject Q7452041.
- Q1134776 subject Q8266681.
- Q1134776 subject Q8851969.
- Q1134776 abstract "In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician Robert P. Dilworth (1950).An antichain in a partially ordered set is a set of elements no two of which are comparable to each other, and a chain is a set of elements every two of which are comparable. Dilworth's theorem states that there exists an antichain A, and a partition of the order into a family P of chains, such that the number of chains in the partition equals the cardinality of A. When this occurs, A must be the largest antichain in the order, for any antichain can have at most one element from each member of P. Similarly, P must be the smallest family of chains into which the order can be partitioned, for any partition into chains must have at least one chain per element of A. The width of the partial order is defined as the common size of A and P.An equivalent way of stating Dilworth's theorem is that, in any finite partially ordered set, the maximum number of elements in any antichain equals the minimum number of chains in any partition of the set into chains. A version of the theorem for infinite partially ordered sets states that, in this case, a partially ordered set has finite width w if and only if it may be partitioned into w chains, but not less.".
- Q1134776 thumbnail Dilworth-via-König.svg?width=300.
- Q1134776 wikiPageExternalLink DualOfDilworthsTheorem.html.
- Q1134776 wikiPageExternalLink VOTMSTOEAS.pdf.
- Q1134776 wikiPageExternalLink 10.pdf.
- Q1134776 wikiPageExternalLink books?id=FYV6tGm3NzgC&pg=PA59.
- Q1134776 wikiPageExternalLink GS-05R-1.pdf.
- Q1134776 wikiPageWikiLink Q1060343.
- Q1134776 wikiPageWikiLink Q1069998.
- Q1134776 wikiPageWikiLink Q1094975.
- Q1134776 wikiPageWikiLink Q1130535.
- Q1134776 wikiPageWikiLink Q1187620.
- Q1134776 wikiPageWikiLink Q141488.
- Q1134776 wikiPageWikiLink Q174733.
- Q1134776 wikiPageWikiLink Q177646.
- Q1134776 wikiPageWikiLink Q1872826.
- Q1134776 wikiPageWikiLink Q205170.
- Q1134776 wikiPageWikiLink Q2226786.
- Q1134776 wikiPageWikiLink Q2393193.
- Q1134776 wikiPageWikiLink Q2707818.
- Q1134776 wikiPageWikiLink Q3406325.
- Q1134776 wikiPageWikiLink Q3527054.
- Q1134776 wikiPageWikiLink Q381060.
- Q1134776 wikiPageWikiLink Q395.
- Q1134776 wikiPageWikiLink Q431937.
- Q1134776 wikiPageWikiLink Q474715.
- Q1134776 wikiPageWikiLink Q4774922.
- Q1134776 wikiPageWikiLink Q4973304.
- Q1134776 wikiPageWikiLink Q504843.
- Q1134776 wikiPageWikiLink Q5155607.
- Q1134776 wikiPageWikiLink Q5282038.
- Q1134776 wikiPageWikiLink Q536640.
- Q1134776 wikiPageWikiLink Q564426.
- Q1134776 wikiPageWikiLink Q5693708.
- Q1134776 wikiPageWikiLink Q7007192.
- Q1134776 wikiPageWikiLink Q7100431.
- Q1134776 wikiPageWikiLink Q7168084.
- Q1134776 wikiPageWikiLink Q7452041.
- Q1134776 wikiPageWikiLink Q761631.
- Q1134776 wikiPageWikiLink Q76592.
- Q1134776 wikiPageWikiLink Q8266681.
- Q1134776 wikiPageWikiLink Q858520.
- Q1134776 wikiPageWikiLink Q8851969.
- Q1134776 wikiPageWikiLink Q897769.
- Q1134776 wikiPageWikiLink Q902252.
- Q1134776 wikiPageWikiLink Q908627.
- Q1134776 wikiPageWikiLink Q976607.
- Q1134776 comment "In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician Robert P. Dilworth (1950).An antichain in a partially ordered set is a set of elements no two of which are comparable to each other, and a chain is a set of elements every two of which are comparable.".
- Q1134776 label "Dilworth's theorem".
- Q1134776 depiction Dilworth-via-König.svg.