Counting perfect matchings in Dirac hypergraphs
M.A. Kwan, R. Safavi Hemami, Y. Wang, Combinatorica 46 (2026).

Randomly perturbed digraphs also have bounded-degree spanning trees
P. Morawski, K.H. Petrova, Electronic Journal of Combinatorics 33 (2026).

The Hamilton space of pseudorandom graphs
M. Christoph, R. Nenadov, K.H. Petrova, Journal of Combinatorial Theory Series B 176 (2026) 254–267.

Odd-Ramsey numbers of complete bipartite graphs
S. Boyadzhiyska, S. Das, T. Lesgourgues, K.H. Petrova, European Journal of Combinatorics 131 (2026).

On random matrices with large corank
Z. Hunter, M.A. Kwan, L. Sauermann, M. Sawhney, International Mathematics Research Notices 2026 (2026).

Packing subdivisions into regular graphs
R. Montgomery, K.H. Petrova, A. Ranganathan, J. Tan, ArXiv (n.d.).

Resolution of the quadratic Littlewood–Offord problem
M.A. Kwan, L. Sauermann, Compositio Mathematica 161 (2025) 3089–3139.

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.

On heroes in digraphs with forbidden induced forests
A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (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).

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.

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

SizeRamsey numbers of graphs with maximum degree three
N. Dragani, K.H. Petrova, Journal of the London Mathematical Society 111 (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).

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

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 15 (2025) 1517–1535.

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 87 (2025) 983–1007.

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