<?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>Off-diagonal Ramsey numbers for linear hypergraphs</title></titleInfo>


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


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

<name type="personal">
  <namePart type="given">Xiaoyu</namePart>
  <namePart type="family">He</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jiaxi</namePart>
  <namePart type="family">Nie</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>
<name type="personal">
  <namePart type="given">Hung-Hsun</namePart>
  <namePart type="family">Yu</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>














<abstract lang="eng">We study off-diagonal Ramsey numbers 𝑟⁡(𝐻,𝐾(𝑘)
𝑛) of 𝑘-uniform hypergraphs, where 𝐻 is a fixed linear 𝑘-uniform hypergraph and 𝐾(𝑘)
𝑛 is complete on 𝑛 vertices. Recently, Conlon, Fox, Gunby, He, Mubayi, Suk, and Verstraëte disproved the folklore conjecture that 𝑟⁡(𝐻,𝐾(3)
𝑛) always grows polynomially in 𝑛. In this paper, we show that much larger growth rates are possible in higher uniformity. In uniformity 𝑘 ≥4, we prove that for any constant 𝐶 &gt;0, there exists a linear 𝑘-uniform hypergraph 𝐻 for which

𝑟⁡(𝐻,𝐾(𝑘)
𝑛)≥twr𝑘−2⁢(2(log⁡𝑛)𝐶).</abstract>
<accessCondition type="use and reproduction">https://creativecommons.org/licenses/by/4.0/</accessCondition>
<originInfo><publisher>Cambridge University Press</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Combinatorics, Probability and Computing</title></titleInfo>
  <identifier type="issn">0963-5483</identifier>
  <identifier type="eIssn">1469-2163</identifier>
  <identifier type="arXiv">2507.05641</identifier><identifier type="doi">10.1017/s0963548326100443</identifier>
<part><extent unit="pages">1-14</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ama>He X, Nie J, Wigderson Y, Yu H-H. Off-diagonal Ramsey numbers for linear hypergraphs. &lt;i&gt;Combinatorics, Probability and Computing&lt;/i&gt;. 2026:1-14. doi:&lt;a href=&quot;https://doi.org/10.1017/s0963548326100443&quot;&gt;10.1017/s0963548326100443&lt;/a&gt;</ama>
<apa>He, X., Nie, J., Wigderson, Y., &amp;#38; Yu, H.-H. (2026). Off-diagonal Ramsey numbers for linear hypergraphs. &lt;i&gt;Combinatorics, Probability and Computing&lt;/i&gt;. Cambridge University Press. &lt;a href=&quot;https://doi.org/10.1017/s0963548326100443&quot;&gt;https://doi.org/10.1017/s0963548326100443&lt;/a&gt;</apa>
<ista>He X, Nie J, Wigderson Y, Yu H-H. 2026. Off-diagonal Ramsey numbers for linear hypergraphs. Combinatorics, Probability and Computing., 1–14.</ista>
<short>X. He, J. Nie, Y. Wigderson, H.-H. Yu, Combinatorics, Probability and Computing (2026) 1–14.</short>
<chicago>He, Xiaoyu, Jiaxi Nie, Yuval Wigderson, and Hung-Hsun Yu. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” &lt;i&gt;Combinatorics, Probability and Computing&lt;/i&gt;. Cambridge University Press, 2026. &lt;a href=&quot;https://doi.org/10.1017/s0963548326100443&quot;&gt;https://doi.org/10.1017/s0963548326100443&lt;/a&gt;.</chicago>
<ieee>X. He, J. Nie, Y. Wigderson, and H.-H. Yu, “Off-diagonal Ramsey numbers for linear hypergraphs,” &lt;i&gt;Combinatorics, Probability and Computing&lt;/i&gt;. Cambridge University Press, pp. 1–14, 2026.</ieee>
<mla>He, Xiaoyu, et al. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” &lt;i&gt;Combinatorics, Probability and Computing&lt;/i&gt;, Cambridge University Press, 2026, pp. 1–14, doi:&lt;a href=&quot;https://doi.org/10.1017/s0963548326100443&quot;&gt;10.1017/s0963548326100443&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22152</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T10:47:02Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-08T07:24:54Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
