--- title: Ramsey Theory description: Ramsey theory studies the conditions under which order must appear within large, chaotic mathematical structures. Learners will understand how to find guaranteed monochromatic substructures in colored graphs and apply these limits to combinatorics. category: mathematics subcategory: combinatorics difficulty: beginner, intermediate, advanced url: /subject/ramsey-theory --- # Ramsey Theory Ramsey theory studies the conditions under which order must appear within large, chaotic mathematical structures. Learners will understand how to find guaranteed monochromatic substructures in colored graphs and apply these limits to combinatorics. ## Available Resources 2 Books • 1 Courses • 3 Websites • 3 Papers ## Books ### 1. Extremal Graph and Hypergraph Theory: With Ramsey Theory **Author:** Dhruv Mubayi, Jacques A. Verstraëte Cambridge Studies in Advanced Mathematics text covering Turán-type problems for graphs and hypergraphs and Ramsey theory, using probabilistic and algebraic methods, with complete proofs of recent results on sunflowers and off-diagonal and geometric Ramsey numbers. Readers can follow and apply current research techniques. **Difficulty:** Advanced | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/1009585843?tag=edmonddante07-20 **Tags:** extremal-graph-theory, hypergraphs, ramsey-theory, combinatorics, turan-problems ### 2. Ramsey Theory **Author:** Ronald L. Graham, Bruce L. Rothschild, Joel H. Spencer The standard monograph on Ramsey theory (1980 first edition) by three leading combinatorialists. Develops Ramsey's theorem, van der Waerden's theorem on arithmetic progressions, the Hales-Jewett theorem, Rado's theorems for integers, and graph Ramsey theory, preparing readers for research-level combinatorics. **Difficulty:** Intermediate | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/0471059978?tag=edmonddante07-20 **Tags:** books, mathematics-statistics, combinatorics ## Websites ### 1. Extremal Graph Theory and Ramsey Theory (PCMI 2025 Undergraduate Summer School) **Author:** Yuval Wigderson (notes by Sanjana Das) The only genuinely accessible on-ramp found that is still fully rigorous: it assumes no graduate background, builds extremal numbers from Mantel forward, and proves Erdős-Stone-Simonovits and Kővári-Sós-Turán in full. Eighty pages of notes from Yuval Wigderson's 2025 PCMI undergraduate summer school, working from extremal numbers and Erdős-Stone-Simonovits through Kővári-Sós-Turán, supersaturation and stability, then continuing into graph and hypergraph Ramsey numbers. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://www.ias.edu/sites/default/files/uss.pdf **Tags:** extremal-graph-theory, ramsey-theory, combinatorics, lecture-notes ### 2. Introduction to Ramsey Theory (undergraduate lecture notes, 2nd edition) **Author:** Veselin Jungić Undergraduate lecture notes, second edition, developing Ramsey's theorem, van der Waerden's and Schur's theorems, the Hales-Jewett theorem and Rado's work, with historical notes, worked examples and exercises. Creative Commons licensed PDF. **Difficulty:** Beginner | **Language:** English | **Price:** Free **Link:** https://www.sfu.ca/~vjungic/Ramsey/RamseyNotes.pdf **Tags:** ramsey-theory, van-der-waerden-theorem, schur-theorem, hales-jewett-theorem, rado-theorem, combinatorics ### 3. Wolfram MathWorld **Author:** Eric W. Weisstein MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://mathworld.wolfram.com **Tags:** mathematics-reference, encyclopedia, abstract-algebra, number-theory, geometry ## Papers ### 1. An Exponential Improvement for Diagonal Ramsey **Author:** Marcelo Campos, Simon Griffiths, Robert Morris, Julian Sahasrabudhe Research paper proving R(k) is at most (4 minus epsilon) to the k, the first exponential improvement on the Erdős-Szekeres upper bound of 1935. Introduces the book algorithm for locating cliques in two-colored complete graphs. The endpoint of the ladder: a learner who has worked through the course and surveys should read the paper that changed the headline bound, and its introduction is unusually readable about why the Erdős-Szekeres argument resisted improvement for so long. **Difficulty:** Advanced | **Language:** English | **Price:** Free **Link:** https://arxiv.org/abs/2303.09521 **Tags:** ramsey-numbers, diagonal-ramsey, upper-bounds, extremal-combinatorics, graph-theory ### 2. Small Ramsey Numbers (Dynamic Survey DS1) **Author:** Stanisław Radziszowski Every other source defers to this document for actual numeric values. Continuously revised reference compiling all known nontrivial values and bounds for two-color, multicolor, graph and hypergraph Ramsey numbers, with citations to the constructions and computations behind each entry. Latest revision April 2026. **Difficulty:** Advanced | **Language:** English | **Price:** Free **Link:** https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS1 **Tags:** ramsey-numbers, small-ramsey-numbers, multicolor-ramsey, hypergraph-ramsey, graph-theory ### 3. Recent Developments in Graph Ramsey Theory **Author:** David Conlon, Jacob Fox, Benny Sudakov The standard orientation document for anyone moving from a course to the literature: it states what is known, what the proof techniques are, and which problems are open, with a bibliography that functions as the field's reading list. Fifty-four page survey of graph Ramsey theory covering diagonal and off-diagonal bounds, Ramsey numbers of sparse and degenerate graphs, hypergraph and induced Ramsey problems, and Ramsey-Turán questions, with open problems. Published in Surveys in Combinatorics 2015. **Difficulty:** Advanced | **Language:** English | **Price:** Free **Link:** https://arxiv.org/abs/1501.02474 **Tags:** graph-ramsey-theory, ramsey-numbers, extremal-combinatorics, hypergraphs, open-problems ## Courses ### 1. Ramsey Theory (ETH Zürich 401-4054, Spring 2024) **Author:** Yuval Wigderson ETH Zürich graduate course page with complete lecture notes, recordings, twelve problem sets and exam solutions, covering classical bounds, off-diagonal and multicolor Ramsey numbers, the regularity method, induced and canonical Ramsey theorems, and Hales-Jewett. **Difficulty:** Advanced | **Language:** English | **Price:** Free **Link:** https://ywigderson.math.ethz.ch/math/teaching/ramsey2024/ **Tags:** ramsey-theory, ramsey-numbers, regularity-method, hales-jewett-theorem, extremal-combinatorics --- *This content is part of Dantes.io - Your Treasure Map to Knowledge* *Curated by humans at Dantes.io. Personal study use welcome; republishing this curation requires permission (team@dantes.io).* View this page online: https://dantes.io/subject/ramsey-theory