Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 017_RamseyProblem (Ramsey problem) — Constraint detection

A related problem -LRB- which is often called the Ramsey problem -RRB- is to colour the edges of a complete graph with n nodes using at most k colours , in such a way that there is no monochromatic triangle in the graph , i.e. in any triangle at most two edges have the same colour . With 3 colours , the problem has a solution if n > 17 .

Problem 017_RamseyProblem (Ramsey problem) — Detection of the decisions and objects to be modeled

A related problem -LRB- which is often called the Ramsey problem -RRB- is to colour the edges of a complete graph with n nodes using at most k colours , in such a way that there is no monochromatic triangle in the graph , i.e. in any triangle at most two edges have the same colour . With 3 colours , the problem has a solution if n > 17 .

Back to list