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).

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

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

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.

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

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).

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.

Beyond the pseudoforest strong Nine Dragon Tree theorem
S. Mies, B. Moore, E. Smith-Roberge, European Journal of Combinatorics 130 (2025).

The edge-statistics conjecture for hypergraphs
V. Jain, M.A. Kwan, D. Mubayi, T. Tran, International Mathematics Research Notices 2025 (2025).

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.