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


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


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

<name type="personal">
  <namePart type="given">EDEN</namePart>
  <namePart type="family">KUPERWASSER</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">WOJCIECH</namePart>
  <namePart type="family">SAMOTIJ</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">Let us say that a graph G is Ramsey for a tuple (H1, ... , Hr) of graphs if every r-colouring
of the edges of G contains a monochromatic copy of Hi in colour i, for some i ∈ [[r]].
A famous conjecture of Kohayakawa and Kreuter, extending seminal work of Rödl and
Rucinski, predicts the threshold at which the binomial random graph ´ Gn,p becomes Ramsey
for (H1, ... , Hr) asymptotically almost surely.
In this paper, we resolve the Kohayakawa–Kreuter conjecture for almost all tuples of
graphs. Moreover, we reduce its validity to the truth of a certain deterministic statement,
which is a clear necessary condition for the conjecture to hold. All of our results actually hold in greater generality, when one replaces the graphs H1, ... , Hr by finite families
H1, ... , Hr. Additionally, we pose a natural (deterministic) graph-partitioning conjecture,
which we believe to be of independent interest, and whose resolution would imply the
Kohayakawa–Kreuter conjecture.</abstract>

<originInfo><publisher>Cambridge University Press</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Mathematical Proceedings of the Cambridge Philosophical Society</title></titleInfo>
  <identifier type="issn">0305-0041</identifier>
  <identifier type="eIssn">1469-8064</identifier>
  <identifier type="arXiv">2307.16611</identifier><identifier type="doi">10.1017/s0305004125000143</identifier>
<part><detail type="volume"><number>178</number></detail><detail type="issue"><number>3</number></detail><extent unit="pages">293-320</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<short>E. KUPERWASSER, W. SAMOTIJ, Y. Wigderson, Mathematical Proceedings of the Cambridge Philosophical Society 178 (2025) 293–320.</short>
<ama>KUPERWASSER E, SAMOTIJ W, Wigderson Y. On the Kohayakawa–Kreuter conjecture. &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. 2025;178(3):293-320. doi:&lt;a href=&quot;https://doi.org/10.1017/s0305004125000143&quot;&gt;10.1017/s0305004125000143&lt;/a&gt;</ama>
<apa>KUPERWASSER, E., SAMOTIJ, W., &amp;#38; Wigderson, Y. (2025). On the Kohayakawa–Kreuter conjecture. &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. Cambridge University Press. &lt;a href=&quot;https://doi.org/10.1017/s0305004125000143&quot;&gt;https://doi.org/10.1017/s0305004125000143&lt;/a&gt;</apa>
<ista>KUPERWASSER E, SAMOTIJ W, Wigderson Y. 2025. On the Kohayakawa–Kreuter conjecture. Mathematical Proceedings of the Cambridge Philosophical Society. 178(3), 293–320.</ista>
<chicago>KUPERWASSER, EDEN, WOJCIECH SAMOTIJ, and Yuval Wigderson. “On the Kohayakawa–Kreuter Conjecture.” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. Cambridge University Press, 2025. &lt;a href=&quot;https://doi.org/10.1017/s0305004125000143&quot;&gt;https://doi.org/10.1017/s0305004125000143&lt;/a&gt;.</chicago>
<mla>KUPERWASSER, EDEN, et al. “On the Kohayakawa–Kreuter Conjecture.” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;, vol. 178, no. 3, Cambridge University Press, 2025, pp. 293–320, doi:&lt;a href=&quot;https://doi.org/10.1017/s0305004125000143&quot;&gt;10.1017/s0305004125000143&lt;/a&gt;.</mla>
<ieee>E. KUPERWASSER, W. SAMOTIJ, and Y. Wigderson, “On the Kohayakawa–Kreuter conjecture,” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;, vol. 178, no. 3. Cambridge University Press, pp. 293–320, 2025.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22168</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T10:55:00Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-14T08:38:08Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
