Off-diagonal Ramsey numbers for linear hypergraphs He, Xiaoyu Nie, Jiaxi Wigderson, Yuval Yu, Hung-Hsun ddc:500 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 𝐶 >0, there exists a linear 𝑘-uniform hypergraph 𝐻 for which 𝑟⁡(𝐻,𝐾(𝑘) 𝑛)≥twr𝑘−2⁢(2(log⁡𝑛)𝐶). Cambridge University Press 2026 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/22152 He X, Nie J, Wigderson Y, Yu H-H. Off-diagonal Ramsey numbers for linear hypergraphs. <i>Combinatorics, Probability and Computing</i>. 2026:1-14. doi:<a href="https://doi.org/10.1017/s0963548326100443">10.1017/s0963548326100443</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1017/s0963548326100443 info:eu-repo/semantics/altIdentifier/issn/0963-5483 info:eu-repo/semantics/altIdentifier/e-issn/1469-2163 info:eu-repo/semantics/altIdentifier/arxiv/2507.05641 info:eu-repo/semantics/openAccess