@article{22152,
  abstract     = {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⁡𝑛)𝐶).},
  author       = {He, Xiaoyu and Nie, Jiaxi and Wigderson, Yuval and Yu, Hung-Hsun},
  issn         = {1469-2163},
  journal      = {Combinatorics, Probability and Computing},
  pages        = {1--14},
  publisher    = {Cambridge University Press},
  title        = {{Off-diagonal Ramsey numbers for linear hypergraphs}},
  doi          = {10.1017/s0963548326100443},
  year         = {2026},
}

@article{23123,
  abstract     = {How many points can be placed in an 𝑛 × 𝑛 grid sothat every (affine) line contains at most 𝑘 points? Weprove that for 𝑛 ⩾ 𝑘 ⩾ 1037 the maximum number ofpoints is exactly 𝑘𝑛. Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult when 𝑘 is at least about √𝑛 log 𝑛), incorporat-ing ideas of Jain and Pham. Using the same approach,we also obtain new bounds for higher-dimensionalextensions of this problem},
  author       = {Grebennikov, Aleksandr and Kwan, Matthew Alan},
  issn         = {1469-2120},
  journal      = {Bulletin of the London Mathematical Society},
  number       = {10},
  publisher    = {Wiley},
  title        = {{No‐(k+1)‐in‐line problem for large constant k}},
  doi          = {10.1112/blms.70510},
  volume       = {58},
  year         = {2026},
}