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 neither totally connected nor totally unconnected. An example in Mathprog may be found on this page http://rosettacode.org/wiki/Execute_Ramsey_Mathprog.
This may be run:
glpsol --math R_4_4_17.mprog --output R_4_4_17.sol (see page http://rosettacode.org/wiki/Category:Mathprog)
The solution may be viewed on this page http://rosettacode.org/wiki/Solution_Ramsey_Mathprog
In the mprog file each clique is named as st<xxxxxx>. A corresponding entry in the solution file identifies the number of nodes connected in this clique. In the second part of the solution the status of each arc in the graph, connected=1 unconnected=0 is shown.