Ramsey's theorem: Difference between revisions

Content added Content deleted
m (→‎{{header|Sidef}}: modified the code to work with Sidef 2.30)
m (added whitespace before the TOC (table of contents), added a ;Task: (bold) header.)
Line 1: Line 1:
{{draft task}}
{{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.
;Task:
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.
<br><br>


=={{header|C}}==
=={{header|C}}==
Retrieved from "https://rosettacode.org/wiki/Ramsey%27s_theorem"