Ramsey's theorem
id:
ramsey-s-theorem-165-7499715
title:
Ramsey's theorem
text:
In combinatorics, Ramsey's theorem, in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling of a sufficiently large complete graph. To demonstrate the theorem for two colours, let r and s be any two positive integers. Ramsey's theorem states that there exists a least positive integer R(r, s) for which every blue-red edge colouring of the complete graph on R(r, s) vertices contains a blue clique on r vertices or a red clique on s vertices. Ramsey
brand slug:
wiki
category slug:
encyclopedia
description:
Statement in mathematical combinatorics
original url:
https://en.wikipedia.org/wiki/Ramsey%27s_theorem
date created:
2003-02-18T20:17:27Z
date modified:
2024-08-29T07:31:59Z
main entity:
{"identifier":"Q918099","url":"https://www.wikidata.org/entity/Q918099"}
image:
fields total:
13
integrity:
15