Source: wikibot/ramsey-s-theorem
= Ramsey's theorem
{wiki=Ramsey's_theorem}
Ramsey's theorem is a fundamental result in combinatorial mathematics and graph theory that addresses the conditions under which order must appear in a large enough structure. The theorem essentially states that in any sufficiently large graph, one can find certain types of complete subgraphs.