Ramsey's theorem: Difference between revisions
Content added Content deleted
(→Tcl: Added implementation) |
(MAJOR CHANGE: Extended task) |
||
Line 1:
{{draft task}}
The task is to find a graph with 17 Nodes such that any 4 Nodes are neither totally connected nor totally unconnected, so demonstrating [[wp:Ramsey's theorem|Ramsey's theorem]]. A specially-nominated solution may be used, but if so it '''must''' be checked to see if if there are any sub-graphs that are totally connected or totally unconnected.
=={{header|C}}==
| |||