<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe)</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Yuval</namePart>
  <namePart type="family">Wigderson</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">2d0023a0-1567-11f0-833d-d5c1e476d4b5</identifier></name>














<abstract lang="eng">Ramsey&apos;s theorem states that if N
 is sufficiently large, then no matter how one colors the edges among N
 vertices with two colors, there are always k
 vertices spanning edges in only one color. Given this theorem, it is natural to ask &quot;how large is sufficiently large?&quot; Ramsey&apos;s original proof showed that N=k!
 is sufficient, and five years later Erdős and Szekeres improved this bound to N=4^k
. And then progress stalled for almost 90 years.

In this survey, I present the history of the problem, and discuss some of the ideas used in the recent breakthrough of Campos–Griffiths–Morris–Sahasrabudhe, who proved that N=3.993^k
 is sufficient. In addition, I discuss the subsequent work of Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, and Tiba, who gave an alternative, and more conceptual, proof.</abstract>
<abstract lang="fre">Le théorème de Ramsey stipule que si N
 est suffisamment grand, alors quelle que soit la manière dont l&apos;on colore les arêtes entre N
 sommets avec deux couleurs, il y a toujours k
 sommets dont les arêtes ne sont colorées que d&apos;une seule couleur. Compte tenu de ce théorème, il est naturel de se demander &quot;À quel point N
 doit être grand ?&quot; La preuve originale de Ramsey a montré que N=k!
 suffit, et cinq ans plus tard, Erdős et Szekeres ont amélioré cette borne à N=4k
. Puis le progrès s&apos;est arrêté pendant près de 90 ans.

Dans cet exposé, je présente l&apos;histoire du problème et je discute certaines idées utilisées dans la percée récente de Campos--Griffiths-Morris--Sahasrabudhe, qui ont prouvé que N=3,993k
 suffit. De plus, je discute le travail suivant de Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, et Tiba, qui ont donné une preuve alternative et plus conceptuelle.</abstract>

<originInfo><publisher>Societe Mathematique de France</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Astérisque</title></titleInfo>
  <identifier type="issn">0303-1179</identifier>
  <identifier type="issn">2492-5926</identifier>
  <identifier type="arXiv">2411.09321</identifier><identifier type="doi">10.24033/ast.1255</identifier>
<part><extent unit="pages">85-138</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ista>Wigderson Y. 2026. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque., 85–138.</ista>
<ama>Wigderson Y. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). &lt;i&gt;Astérisque&lt;/i&gt;. 2026:85-138. doi:&lt;a href=&quot;https://doi.org/10.24033/ast.1255&quot;&gt;10.24033/ast.1255&lt;/a&gt;</ama>
<mla>Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” &lt;i&gt;Astérisque&lt;/i&gt;, Societe Mathematique de France, 2026, pp. 85–138, doi:&lt;a href=&quot;https://doi.org/10.24033/ast.1255&quot;&gt;10.24033/ast.1255&lt;/a&gt;.</mla>
<ieee>Y. Wigderson, “Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe),” &lt;i&gt;Astérisque&lt;/i&gt;. Societe Mathematique de France, pp. 85–138, 2026.</ieee>
<chicago>Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” &lt;i&gt;Astérisque&lt;/i&gt;. Societe Mathematique de France, 2026. &lt;a href=&quot;https://doi.org/10.24033/ast.1255&quot;&gt;https://doi.org/10.24033/ast.1255&lt;/a&gt;.</chicago>
<short>Y. Wigderson, Astérisque (2026) 85–138.</short>
<apa>Wigderson, Y. (2026). Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). &lt;i&gt;Astérisque&lt;/i&gt;. Societe Mathematique de France. &lt;a href=&quot;https://doi.org/10.24033/ast.1255&quot;&gt;https://doi.org/10.24033/ast.1255&lt;/a&gt;</apa>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22184</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T12:02:59Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-14T09:53:07Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
