On the (k + 2, k)-problem of Brown, Erds, and Sós for k = 5,6,7
S. Glock, J. Kim, L. Lichev, O. Pikhurko, S. Sun, Canadian Journal of Mathematics (2025) 1–43.

On the chromatic number of powers of subdivisions of graphs
M. Anastos, S. Boyadzhiyska, S. Rathke, J. Rué, Discrete Applied Mathematics 360 (2025) 506–511.

The completion numbers of hamiltonicity and pancyclicity in random graphs
Y. Alon, M. Anastos, Random Structures and Algorithms 66 (2025).

SizeRamsey numbers of graphs with maximum degree three
N. Dragani, K.H. Petrova, Journal of the London Mathematical Society 111 (2025).

Subchromatic numbers of powers of graphs with excluded minors
P.P. Cortés, P. Kumar, B. Moore, P. Ossona de Mendez, D.A. Quiroz, Discrete Mathematics 348 (2025).

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
M. Anastos, Z. Jin, M.A. Kwan, B. Sudakov, Forum of Mathematics, Sigma 13 (2025).

Books, Hallways, and social butterflies: A note on sliding block puzzles
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer 47 (2025) 52–65.

On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025).

A note on finding large transversals efficiently
M. Anastos, P. Morris, Journal of Combinatorial Designs (2025).

Color-avoiding percolation on the Erds–Rényi random graph
L. Lichev, B. Schapira, Annales Henri Lebesgue 8 (2025) 35–65.

Precoloring extension in planar near-Eulerian-triangulations
Z. Dvoák, B. Moore, M. Seifrtová, R. Sámal, European Journal of Combinatorics 127 (2025).

The semi-random tree process
S. Burova, L. Lichev, European Journal of Combinatorics 126 (2025).

A central limit theorem for the matching number of a sparse random graph
M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the London Mathematical Society 111 (2025).

Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, Algorithmica (2025).

Smoothed analysis for graph isomorphism
M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 2098–2106.

A note on digraph splitting
M. Christoph, K.H. Petrova, R. Steiner, Combinatorics Probability and Computing 34 (2025) 559–564.

Random zero-sum dynamic games on infinite directed graphs
L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications (2025).

Decompositions into two linear forests of bounded lengths
R. Campbell, F. Hörsch, B. Moore, Discrete Mathematics 347 (2024).

High-girth Steiner triple systems
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Annals of Mathematics 200 (2024) 1059–1156.

The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
M. Anastos, B. Auerbach, M.A. Baig, M. Cueto Noval, M.A. Kwan, G. Pascual Perez, K.Z. Pietrzak, in:, 22nd International Conference on Theory of Cryptography, Springer Nature, 2024, pp. 413–443.