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 (n.d.).

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

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.

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

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

Partitioning problems via random processes
M. Anastos, O. Cooley, M. Kang, M.A. Kwan, Journal of the London Mathematical Society 110 (2024).

Climbing up a random subgraph of the hypercube
M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).

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.

Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
J. Lill, K.H. Petrova, S. Weber, in:, 19th International Symposium on Parameterized and Exact Computation, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

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

The inertia bound is far from tight
M.A. Kwan, Y. Wigderson, Bulletin of the London Mathematical Society 56 (2024) 3196–3208.

Local dimer dynamics in higher dimensions
I. Hartarsky, L. Lichev, F.L. Toninelli, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions (2024).

Exponentially many graphs are determined by their spectrum
I. Koval, M.A. Kwan, Quarterly Journal of Mathematics 75 (2024) 869–899.

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

Books, Hallways, and social butterflies: A note on sliding block puzzles
F.R. Brunck, M.A. Kwan, Mathematical Intelligencer (2024).

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

Splitting matchings and the Ryser-Brualdi-Stein conjecture for multisets
M. Anastos, D. Fabian, A. Müyesser, T. Szabó, Electronic Journal of Combinatorics 30 (2023).

Fast algorithms for solving the Hamilton cycle problem with high probability
M. Anastos, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 2286–2323.

Substructures in Latin squares
M.A. Kwan, A. Sah, M. Sawhney, M. Simkin, Israel Journal of Mathematics 256 (2023) 363–416.