| Display title | Hadwiger conjecture (graph theory) |
| Default sort key | Hadwiger Conjecture (Graph Theory) |
| Page length (in bytes) | 19,250 |
| Namespace ID | 0 |
| Page ID | 1657860 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 30 |
| Number of page watchers who visited in the last 30 days | There may or may not be a watching user visiting recent edits |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1128435 |
| Local description | Unproven generalization of the four-color theorem |
| Central description | conjecture that all graphs requiring k or more colors contain a k-vertex complete minor |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Edemaine (talk | contribs) |
| Date of page creation | 02:16, 28 March 2005 |
| Latest editor | IznoRepeat (talk | contribs) |
| Date of latest edit | 20:54, 27 March 2024 |
| Total number of edits | 161 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (50) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
