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_RamseyNumbers (Ramsey numbers) — Constraint detection

The Ramsey number R -LRB- k , l -RRB- is the smallest number such that every graph with this or more nodes either contains a clique of size k or an independent set of size l . Ramsey proved that such a number exists for every -LRB- k , l -RRB- pair , but computing it has proven to be extremely difficult . The problem can be posed as edge-colouring . The Ramsey number R -LRB- k , l -RRB- is the smallest number such that if we two-colour the edges of complete graph of this size , there always exists a monochromatic sub-graph of either k or l nodes .

Problem 017_RamseyNumbers (Ramsey numbers) — Detection of the decisions and objects to be modeled

The Ramsey number R -LRB- k , l -RRB- is the smallest number such that every graph with this or more nodes either contains a clique of size k or an independent set of size l . Ramsey proved that such a number exists for every -LRB- k , l -RRB- pair , but computing it has proven to be extremely difficult . The problem can be posed as edge-colouring . The Ramsey number R -LRB- k , l -RRB- is the smallest number such that if we two-colour the edges of complete graph of this size , there always exists a monochromatic sub-graph of either k or l nodes .

Back to list