Information for "Kőnig's theorem (graph theory)"
Basic information
| Display title | Kőnig's theorem (graph theory) |
| Default sort key | Koenigs theorem |
| Page length (in bytes) | 24,415 |
| Namespace ID | 0 |
| Page ID | 5465118 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 54 |
| Number of page watchers who visited in the last 30 days | 5 |
| Number of redirects to this page | 15 |
| Counted as a content page | Yes |
| Wikidata item ID | Q897769 |
| Local description | Theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs |
| Central description | theorem showing that maximum matching and minimum vertex cover are equivalent for bipartite graphs |
| Page image |  |
| Page views in the past 30 days |
Page protection
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
Edit history
| Page creator | RobertBorgersen (talk | contribs) |
| Date of page creation | 15:37, 7 June 2006 |
| Latest editor | Citation bot (talk | contribs) |
| Date of latest edit | 00:05, 30 April 2024 |
| Total number of edits | 204 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |