| Display title | Ramsey's theorem |
| Default sort key | Ramsey's theorem |
| Page length (in bytes) | 73,271 |
| Namespace ID | 0 |
| Page ID | 8329 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Page image |  |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Nigel Galloway (talk | contribs) |
| Date of page creation | 12:23, 7 January 2012 |
| Latest editor | PureFox (talk | contribs) |
| Date of latest edit | 15:32, 29 January 2024 |
| Total number of edits | 92 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Task Find a graph with 17 Nodes such that any 4 Nodes are neither totally connected nor totally unconnected, so demonstrating Ramsey's theorem. A specially-nominated... |
