[{"doi":"10.1017/s0963548326100443","oa":1,"mathsc":["05D10","05D40","05C65"],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"main_file_link":[{"url":"https://doi.org/10.1017/S0963548326100443","open_access":"1"}],"article_processing_charge":"No","external_id":{"arxiv":["2507.05641"]},"article_type":"original","title":"Off-diagonal Ramsey numbers for linear hypergraphs","_id":"22152","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1017/s0963548326100443","day":"14","publication_identifier":{"eissn":["1469-2163"],"issn":["0963-5483"]},"arxiv":1,"page":"1-14","publication_status":"epub_ahead","date_created":"2026-06-29T10:47:02Z","publication":"Combinatorics, Probability and Computing","year":"2026","oa_version":"Published Version","citation":{"apa":"He, X., Nie, J., Wigderson, Y., &#38; Yu, H.-H. (2026). Off-diagonal Ramsey numbers for linear hypergraphs. <i>Combinatorics, Probability and Computing</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0963548326100443\">https://doi.org/10.1017/s0963548326100443</a>","mla":"He, Xiaoyu, et al. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” <i>Combinatorics, Probability and Computing</i>, Cambridge University Press, 2026, pp. 1–14, doi:<a href=\"https://doi.org/10.1017/s0963548326100443\">10.1017/s0963548326100443</a>.","chicago":"He, Xiaoyu, Jiaxi Nie, Yuval Wigderson, and Hung-Hsun Yu. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” <i>Combinatorics, Probability and Computing</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/s0963548326100443\">https://doi.org/10.1017/s0963548326100443</a>.","short":"X. He, J. Nie, Y. Wigderson, H.-H. Yu, Combinatorics, Probability and Computing (2026) 1–14.","ama":"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>","ista":"He X, Nie J, Wigderson Y, Yu H-H. 2026. Off-diagonal Ramsey numbers for linear hypergraphs. Combinatorics, Probability and Computing., 1–14.","ieee":"X. He, J. Nie, Y. Wigderson, and H.-H. Yu, “Off-diagonal Ramsey numbers for linear hypergraphs,” <i>Combinatorics, Probability and Computing</i>. Cambridge University Press, pp. 1–14, 2026."},"date_published":"2026-04-14T00:00:00Z","publisher":"Cambridge University Press","extern":"1","month":"04","ddc":["500"],"language":[{"iso":"eng"}],"abstract":[{"text":"We study off-diagonal Ramsey numbers 𝑟⁡(𝐻,𝐾(𝑘)\r\n𝑛) of 𝑘-uniform hypergraphs, where 𝐻 is a fixed linear 𝑘-uniform hypergraph and 𝐾(𝑘)\r\n𝑛 is complete on 𝑛 vertices. Recently, Conlon, Fox, Gunby, He, Mubayi, Suk, and Verstraëte disproved the folklore conjecture that 𝑟⁡(𝐻,𝐾(3)\r\n𝑛) 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\r\n\r\n𝑟⁡(𝐻,𝐾(𝑘)\r\n𝑛)≥twr𝑘−2⁢(2(log⁡𝑛)𝐶).","lang":"eng"}],"OA_place":"publisher","type":"journal_article","status":"public","quality_controlled":"1","scopus_import":"1","OA_type":"hybrid","date_updated":"2026-07-08T07:24:54Z","author":[{"last_name":"He","first_name":"Xiaoyu","full_name":"He, Xiaoyu"},{"last_name":"Nie","first_name":"Jiaxi","full_name":"Nie, Jiaxi"},{"first_name":"Yuval","last_name":"Wigderson","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"},{"full_name":"Yu, Hung-Hsun","last_name":"Yu","first_name":"Hung-Hsun"}]}]