Image:Dilworth-via-König.png
From Wikipedia, the free encyclopedia
Dilworth-via-König.png (794 × 487 pixel, file size: 20 KB, MIME type: image/png)
[edit] Summary
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 a partition of the order into chains (far right).
[edit] Licensing
I, the creator of this work, hereby release it into the public domain. This applies worldwide.
In case this is not legally possible,
I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
File history
Legend: (cur) = this is the current file, (del) = delete
this old version, (rev) = revert to this old version.
Click on date to download the file or see the image uploaded on that date.
- (del) (cur) 16:02, 13 September 2006 . . David Eppstein (Talk | contribs) . . 794×487 (20,944 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)
- Edit this file using an external application
See the setup instructions for more information.
