Ramsey theory

Definition

Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of the mathematical field of combinatorics that focuses on the appearance of order in a substructure given a structure of a known size. Problems in Ramsey theory typically ask a question of the form: "how big must some structure be to guarantee that a particular property holds?"

Related concepts

Ackermann function Arithmetic progression Bartel Leendert van der Waerden Boolean Pythagorean triples problem Bruce L. Rothschild Brute-force search Combinatorics Complete graph Compositio Mathematica Discrepancy theory Ergodic Ramsey theory Exponential growth Extremal graph theory Frank P. Ramsey George Szekeres Goodstein's theorem Graham's number Hales–Jewett theorem Hillel Furstenberg Hindman's theorem Infinitary combinatorics Joel H. Spencer Journal d'Analyse Mathématique József Solymosi Mathematical proof Milliken–Taylor theorem Non-constructive Paris–Harrington theorem Partition regularity Paul Erdős Pigeonhole principle Primitive recursive Rado's theorem (Ramsey theory)Rado–Folkman–Sanders theorem Ramsey's theorem Ronald L. Graham Schur's theorem Steve Butler (mathematician)Sunflower (mathematics)Szemerédi's theorem Theorem on friends and strangers Tic-tac-toe Turán's theorem Van der Waerden's theorem Yitzhak Katznelson

2 concepts already in your glossary