Ramsey's theorem

From Rosetta Code
Revision as of 12:23, 7 January 2012 by Nigel Galloway (talk | contribs) (Created page with "{{task}} The task is to find a graph with 17 Nodes such that any clique of 4 Nodes is neithr totally connected nor totally unconnected. An example in Mathprog may be found on ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Task
Ramsey's theorem
You are encouraged to solve this task according to the task description, using any language you may know.

The task is to find a graph with 17 Nodes such that any clique of 4 Nodes is neithr totally connected nor totally unconnected. An example in Mathprog may be found on this page http://rosettacode.org/wiki/Execute_Ramsey_Mathprog. http://rosettacode.org/wiki/Solution_Ramsey_Mathprog

Retrieved from "https://rosettacode.org/wiki/Ramsey%27s_theorem?oldid=211053"