ICM 2026 Plenary Lecture - Robert Morris

ICM 2026 Plenary Lecture - Robert Morris

by Robert Morris

Formal & Physical Sciences Mathematics PBMathematics
🎙 Robert Morris 👥 58K 📅 August 17, 2026 ⏱ 56 min 👁 2 📄 expert opinion 🧭 2026-08-17
Available in: English (current) Français

Keywords

Ramsey numbersprobabilistic methodsemi-random methodtriangle-free processhappy ending problem

Summary

In this plenary lecture at ICM 2026, Robert Morris presents a comprehensive overview of Ramsey theory, focusing on recent results and open problems. He begins with the historical origins, including Frank Ramsey’s theorem and the ‘happy ending problem’ posed by Esther Klein, which led to the rediscovery of Ramsey’s theorem. Morris then defines Ramsey numbers and discusses classical bounds, such as the simple upper bound of 4^k and Erdős’s probabilistic lower bound of 2^{k/2}. He introduces the asymmetric version, highlighting the case of R(3,k), where he details the evolution of bounds from Erdős’s geometric construction to the semi-random method and the triangle-free process, culminating in the exact asymptotic constant. For larger l, he notes the gap between upper and lower bounds and mentions Erdős’s conjecture that R(l,k) is polynomial in k for fixed l. The talk emphasizes the interplay between combinatorics and other areas, such as high-dimensional geometry and probability, and showcases the development of powerful methods like the probabilistic method and the semi-random method. Morris concludes by hinting at recent breakthroughs, possibly involving hypergraph containers, that have advanced the field. The lecture is accessible yet technically rich, suitable for a mathematical audience.

193 words

Critical Evaluation

Value of the Information & Strength of the Argument

The lecture provides high value by synthesizing decades of research in Ramsey theory, presenting both classical results and recent advances. Morris’s argumentation is rigorous, with clear logical progression from definitions to proofs and conjectures. He effectively uses historical anecdotes to motivate key concepts, such as the happy ending problem, and demonstrates the power of probabilistic and semi-random methods through concrete examples. The talk is well-structured, balancing technical depth with accessibility, and highlights open problems, encouraging further research. The inclusion of the triangle-free process and its analysis underscores the sophistication of modern techniques. Overall, the content is authoritative and insightful, offering a valuable resource for mathematicians and students.

Scientific Rigor, Source Quality, Title Accuracy

The lecture demonstrates high scientific rigor, with Morris accurately presenting theorems and proofs, and crediting original contributors (e.g., Ramsey, Erdős, Szekeres, Kim). He does not cite external sources explicitly, but the talk is based on established literature in Ramsey theory. The title ‘Recent Results in Ramsey Theory’ accurately reflects the content, as Morris discusses both classical foundations and recent developments, including his own work on R(3,k). The lecture is well-organized and adheres to mathematical standards. No comments were provided for analysis.

203 words

Title / Content Match

The title accurately reflects the content: a plenary lecture on recent results in Ramsey theory.

Quality & Reliability

9/10

Lecture by a leading expert (Fields Medal-level recognition, Royal Society Fellow) presenting well-established results and recent advances in Ramsey theory, with clear proofs and historical context. High reliability, though not peer-reviewed in this format.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

  • Ramsey's original paper — Mentioned as the origin of Ramsey's theorem.
  • Erdős and Szekeres paper on the happy ending problem — Referenced for the geometric problem and the use of Ramsey's theorem.
  • Erdős's 1947 paper on Ramsey numbers — Introduced the probabilistic method and lower bound for R(k,k).
  • Kim's paper on R(3,k) — Mentioned for the lower bound using the semi-random method.
  • Bohman and Keevash's paper on the triangle-free process — Referenced for the analysis of the triangle-free process.

Concurring Sources

Contribution & Novelties

The lecture provides a comprehensive and up-to-date synthesis of Ramsey theory, highlighting recent breakthroughs such as the exact asymptotic for R(3,k) and the development of powerful methods like the probabilistic method and semi-random method. It also emphasizes the cross-disciplinary connections, particularly with high-dimensional geometry. The talk serves as an excellent educational resource and a state-of-the-art review for researchers.

Pour aller plus loin :

  • Ramsey theory on Wikipedia — Provides a broad overview of the field.
  • Probabilistic method — Explains the technique introduced by Erdős.
  • Semi-random method — Discusses the method used in recent bounds.
  • Triangle-free process — Details the process analyzed for R(3,k).
  • Happy ending problem — Historical background and connection to Ramsey theory.

114 words

Radar Profile

The radar profile shows high scores across all dimensions, indicating a well-balanced and authoritative presentation. The lecture excels in information quality and reliability, with strong technical depth and clear argumentation. The only slightly lower score is in quantity of information, but this is due to the focused scope of a single lecture.

Reliability 9/10