Talk:Ramsey's theorem: Difference between revisions

From Rosetta Code
Content added Content deleted
Line 18: Line 18:
explicitly describe how solutions is to generate graphs and check for propeties.
explicitly describe how solutions is to generate graphs and check for propeties.
<small>Written by [[User:Soegaard|Soegaard]] 12 June 2013‎</small>
<small>Written by [[User:Soegaard|Soegaard]] 12 June 2013‎</small>
:Agreed. [[User:Arbautjc|Arbautjc]] ([[User talk:Arbautjc|talk]]) 16:54, 28 October 2013 (UTC)
:Agreed. All solutions are cheating. These programs are useless, except for showing how to build a graph, but the question is much more difficult. [[User:Arbautjc|Arbautjc]] ([[User talk:Arbautjc|talk]]) 16:54, 28 October 2013 (UTC)

Revision as of 16:58, 28 October 2013

Solution(s)

"... happens to have a special solution". Does that mean there are more solutions? Gaaijz 14:09, 29 May 2012 (UTC)

Task quality

Why is this task called “Ramsey”? Surely it's not just pining for a pretty little town on the Isle of Man? (A suitable link to Wikipedia in the task description would be good, and linking to somewhere like Mathworld as well would be better.) –Donal Fellows 10:26, 14 February 2012 (UTC)

http://en.wikipedia.org/wiki/Ramsey%27s_theorem Fwend 19:59, 20 February 2013 (UTC)
This article actually mentions the term clique: http://en.wikipedia.org/wiki/Tournament_%28graph_theory%29

Revision of Task Description needed?

The task description seems to suggest that a solution is to generate graphs, test that the graph has the properties in Ramsays's theorem and then print any such graphs.

The solutions on the other hand cheat: they simply generate a known solution without checking that the graph has the sought after properties.

Either the task description should be changed to "Generate a graph" or it should explicitly describe how solutions is to generate graphs and check for propeties. Written by Soegaard 12 June 2013‎

Agreed. All solutions are cheating. These programs are useless, except for showing how to build a graph, but the question is much more difficult. Arbautjc (talk) 16:54, 28 October 2013 (UTC)