Ramsey's theorem: Difference between revisions

 

=={{header|C}}==

For 17 nodes, (4,4) happens to have a special solution: arrange nodes on a circle, and connect all pairs with distances 1, 2, 4, and 8. It's easier to prove it on paper and just show the result than let a computer find it (you can call it optimization).

<lang c>#include <stdio.h>