Keywords: Dilworth-via-König.svg 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 en wikipedia 2006-09-13 ; colorized and vectorized August 23 2007 David Eppstein wikipedia en David Eppstein original upload log page en wikipedia Dilworth-via-K C3 B6nig png 2006-09-13 16 02 David Eppstein 794×487×8 20944 bytes <nowiki>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</nowiki> Combinatorics Order theory Files by User David Eppstein from en wikipedia Hasse diagrams Location not applicable Matching graph theory |