<?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>Resolution of the Kohayakawa–Kreuter conjecture</title></titleInfo>


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


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

<name type="personal">
  <namePart type="given">Micha</namePart>
  <namePart type="family">Christoph</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Anders</namePart>
  <namePart type="family">Martinsson</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Raphael</namePart>
  <namePart type="family">Steiner</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<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">A graph 𝐺 is said to be Ramsey for a tuple of graphs(𝐻 1 , … , 𝐻𝑟 ) if every 𝑟-coloring of the edges of 𝐺 con-tains a monochromatic copy of 𝐻𝑖 in color 𝑖, for some 𝑖.A fundamental question at the intersection of Ramseytheory and the theory of random graphs is to deter-mine the threshold at which the binomial randomgraph 𝐺𝑛,𝑝 becomes asymptotically almost surely Ram-sey for a fixed tuple (𝐻 1 , … , 𝐻𝑟 ), and a famous conjectureof Kohayakawa and Kreuter predicts this threshold.Earlier work of Mousset–Nenadov–Samotij, Bowtell–Hancock–Hyde, and Kuperwasser–Samotij–Wigdersonhas reduced this probabilistic problem to a determinis-tic graph decomposition conjecture. In this paper, weresolve this deterministic problem, thus proving theKohayakawa–Kreuter conjecture. Along the way, weprove a number of novel graph decomposition resultsthat may be of independent interest.</abstract>
<accessCondition type="use and reproduction">https://creativecommons.org/licenses/by/4.0/</accessCondition>
<originInfo><publisher>Wiley</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the London Mathematical Society</title></titleInfo>
  <identifier type="issn">0024-6115</identifier>
  <identifier type="eIssn">1460-244X</identifier>
  <identifier type="arXiv">2402.03045</identifier><identifier type="doi">10.1112/plms.70013</identifier>
<part><detail type="volume"><number>130</number></detail><detail type="issue"><number>1</number></detail>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<chicago>Christoph, Micha, Anders Martinsson, Raphael Steiner, and Yuval Wigderson. “Resolution of the Kohayakawa–Kreuter Conjecture.” &lt;i&gt;Proceedings of the London Mathematical Society&lt;/i&gt;. Wiley, 2025. &lt;a href=&quot;https://doi.org/10.1112/plms.70013&quot;&gt;https://doi.org/10.1112/plms.70013&lt;/a&gt;.</chicago>
<short>M. Christoph, A. Martinsson, R. Steiner, Y. Wigderson, Proceedings of the London Mathematical Society 130 (2025).</short>
<mla>Christoph, Micha, et al. “Resolution of the Kohayakawa–Kreuter Conjecture.” &lt;i&gt;Proceedings of the London Mathematical Society&lt;/i&gt;, vol. 130, no. 1, e70013, Wiley, 2025, doi:&lt;a href=&quot;https://doi.org/10.1112/plms.70013&quot;&gt;10.1112/plms.70013&lt;/a&gt;.</mla>
<ieee>M. Christoph, A. Martinsson, R. Steiner, and Y. Wigderson, “Resolution of the Kohayakawa–Kreuter conjecture,” &lt;i&gt;Proceedings of the London Mathematical Society&lt;/i&gt;, vol. 130, no. 1. Wiley, 2025.</ieee>
<apa>Christoph, M., Martinsson, A., Steiner, R., &amp;#38; Wigderson, Y. (2025). Resolution of the Kohayakawa–Kreuter conjecture. &lt;i&gt;Proceedings of the London Mathematical Society&lt;/i&gt;. Wiley. &lt;a href=&quot;https://doi.org/10.1112/plms.70013&quot;&gt;https://doi.org/10.1112/plms.70013&lt;/a&gt;</apa>
<ama>Christoph M, Martinsson A, Steiner R, Wigderson Y. Resolution of the Kohayakawa–Kreuter conjecture. &lt;i&gt;Proceedings of the London Mathematical Society&lt;/i&gt;. 2025;130(1). doi:&lt;a href=&quot;https://doi.org/10.1112/plms.70013&quot;&gt;10.1112/plms.70013&lt;/a&gt;</ama>
<ista>Christoph M, Martinsson A, Steiner R, Wigderson Y. 2025. Resolution of the Kohayakawa–Kreuter conjecture. Proceedings of the London Mathematical Society. 130(1), e70013.</ista>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22157</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T10:50:35Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-08T10:24:21Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
