DOI,IST REx ID,Title of publication
10.1017/s0963548326100443,22152,Off-diagonal Ramsey numbers for linear hypergraphs
10.1090/proc/17442,22167,"Ordered Ramsey numbers of graphs with 𝑚 edges"
10.1093/imrn/rnag018,22183,Is it easy to regularize a hypergraph with easy links?
10.24033/ast.1255,22184,"Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe)"
10.1137/24m1714964,22155,Canonical Ramsey numbers of sparse graphs
10.1112/plms.70013,22157,"Resolution of the Kohayakawa–Kreuter conjecture"
10.1017/fms.2024.68,22158,An efficient asymmetric removal lemma and its limitations
10.1016/j.disc.2024.114373,22163,Larger nearly orthogonal sets over finite fields
10.1017/s0305004125000143,22168,"On the Kohayakawa–Kreuter conjecture"
10.19086/aic.2025.10,22172,Blowups of triangle-free graphs
10.1016/j.ejc.2025.104175,22181,Infinitely many minimally non-Ramsey size-linear graphs
10.4086/toc.2025.v021a001,22188,On linear-algebraic notions of expansion
10.1112/blms.13127,22154,The inertia bound is far from tight
10.1007/s11856-024-2624-y,22179,Ramsey numbers of sparse digraphs
10.1002/jgt.23093,22180,Ramsey numbers upon vertex deletion
10.1007/s11856-023-2515-7,22162,Connections between graphs and matrix spaces
10.1007/s00493-023-00034-7,22159,Three early problems on size Ramsey numbers
10.1002/jgt.22891,22164,Minimum degree and the graph removal lemma
10.1017/s0963548322000360,22165,Off-diagonal book Ramsey numbers
10.19086/aic.2023.2,22170,Ramsey multiplicity and the Turán coloring
