This file is from Wikimedia Commons and may be used by other projects.
The description on its file description page there is shown below.
Summary
DescriptionDilworth-via-König.svg
English: 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).
Date
13 September 2006 (original upload date); colorized and vectorized August 23, 2007.
This work has been released into the public domain by its author, David Eppstein at English Wikipedia. This applies worldwide. In some countries this may not be legally possible; if so: David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.Public domainPublic domainfalsefalse
Original upload log
The original description page was here. All following 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
Captions
Add a one-line explanation of what this file represents