Add to ORKGRamsey theory is a eld of study named after the mathematician Frank P. Ramsey. In general, problems in Ramsey theory look for structure amid a collection of unstructured objects and are often solved using techniques of Graph Theory. For a typical question in Ramsey theory, we use two colors, say red and blue, to color the edges of a complete graph, and then look for either a complete subgraph of order n whose edges are all red or a complete subgraph of order m whose edges are all blue. The minimum number of vertices needed to guarantee one of these subgraphs is the Ramsey number, R(n; m). Ramsey\u27s Theorem shows that R(n; m) exists for every n and m greater than one, yet very few Ramsey numbers are known. There are many interesting modifi...