Revision as of 12:53, 7 January 2012 (view source) rosettacode>EMBee (make draft) ← Older edit		Revision as of 12:41, 9 January 2012 (view source) Nigel Galloway (talk \| contribs) No edit summary Newer edit →
Line 1: {{draft task}} 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~~. =={{header\|Mathprog}}== An example in Mathprog may be found on this page http://rosettacode.org/wiki/Execute_Ramsey_Mathprog. This may be run:

Ramsey's theorem: Difference between revisions

Ramsey's theorem (view source)