Image:Dilworth-via-König.svg
From Wikipedia, the free encyclopedia
Dilworth-via-König.svg (SVG file, nominally 800 × 494 pixels, file size: 21 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
| Description |
Proof of Dilworth's theorem via König's theorem. On far left is shown the Hasse diagram of a partial order, and center left a bipartite graph derived from that order. A maximum matching in that graph (center right) leads to a partition of the order into chains (far right). |
|---|---|
| Source |
Originally from en.wikipedia; description page is/was here. |
| Date |
2006-09-13 (original upload date); colorized and vectorized August 23, 2007. |
| Author |
Original uploader was David Eppstein at en.wikipedia |
| Permission (Reusing this image) |
Released into the public domain (by the author). |
[edit] License information
 |
This image has been (or is hereby) released into the public domain by its author, David Eppstein at the wikipedia project. This applies worldwide. In case this is not legally possible: |
[edit] Original upload log
(All user names refer to en.wikipedia)
- 2006-09-13 16:02 David Eppstein 794×487×8 (20944 bytes) Proof of [[Dilworth's theorem]] via [[König's theorem (graph theory)]]. On far left is shown the [[Hasse diagram]] of a partial order, and center left a [[bipartite graph]] derived from that order. A maximum matching in that graph (center right) leads to
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 06:27, 24 August 2007 | 800×494 (21 KB) | David Eppstein | ({{Information |Description=Proof of Dilworth's theorem via König's theorem. On far left is shown the Hasse diagram of a partial order, and center left a [[:en:bipart) |
