Image:Koenigs-theorem-graph.png

From Wikipedia, the free encyclopedia

Wikimedia Commons logo This is a file from the Wikimedia Commons. The description on its description page there is shown below.
Commons is a freely licensed media file repository. You can help.

A vector version of this image (SVG) is available.
It should be used in place of this raster image when superior.

Image:Koenigs-theorem-graph.png  Image:Koenigs-theorem-graph.svg

For more information about vector graphics, read about Commons transition to SVG.
There is also information about MediaWiki's support of SVG images.

Български | Deutsch | English | Español | Français | Galego | עברית | Magyar | Bahasa Indonesia | Italiano | 日本語 | 한국어 | Lietuvių | Polski | Português | Русский | Српски / Srpski | Українська | ‪中文(简体)‬ | ‪中文(繁體)‬ | +/-

 New SVG image
Description

en:König's theorem (graph theory) states that any en:bipartite graph has a en:maximum matching of equal size to a minimum en:vertex cover. This image depicts a bipartite graph with 14 vertices, in which the maximum matching (blue edges) and minimum cover (red vertices) both have size six.
Source

Originally from en.wikipedia; description page is/was here.
Date

2006-10-25 (original upload date)
Author

Original uploader was David Eppstein at en.wikipedia
Permission
(Reusing this image)

Released into the public domain (by the author).

[edit] License information

Public domain 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:
David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

[edit] Original upload log

(All user names refer to en.wikipedia)

  • 2006-10-25 19:52 David Eppstein 450×306×8 (15099 bytes) [[König's theorem (graph theory)]] states that any [[bipartite graph]] has a [[maximum matching]] of equal size to a minimum [[vertex cover]]. This image depicts a bipartite graph with 14 vertices, in which the maximum matching (blue edges) and minimum c

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current17:00, 4 May 2007450×306 (15 KB)Tgr ({{Information |Description=en:König's theorem (graph theory) states that any en:bipartite graph has a en:maximum matching of equal size to a minimum en:vertex cover. This image depicts a bipartite graph with 14 vertices, in which the )
No pages on the English Wikipedia link to this file. (Pages on other projects are not counted.)