- Louis DeBiasio, Jie Han 0002, Allan Lo, Theodore Molla, Simón Piga, Andrew Treglown. Powers of Hamilton cycles in oriented and directed graphs. Combinatorics, Probability & Computing, 35(1):101-133, 2026.
- Frederik Garbe, Daniel Il'kovic, Daniel Král, Filip Kucerák, Ander Lamaison. Hypergraphs with uniform Turán density equal to 8/27. Combinatorics, Probability & Computing, 35(2):280-289, 2026.
- Amelie Menges. Comparing the sets of volume polynomials and Lorentzian polynomials. Combinatorics, Probability & Computing, 35(1):26-39, 2026.
- Oleg Verbitsky 0001, Maksim Zhukovskii. Canonization of a random circulant graph by counting walks. Combinatorics, Probability & Computing, 35(2):178-206, 2026.
- Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser. Random embeddings of bounded-degree trees with optimal spread. Combinatorics, Probability & Computing, 35(1):71-82, 2026.
- Felix Joos, Dhruv Mubayi, Zak Smith. Conflict-free hypergraph matchings and coverings. Combinatorics, Probability & Computing, 35(2):230-254, 2026.
- Amarja Kathapurkar, Patrick Morris 0001, Guillem Perarnau. A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs. Combinatorics, Probability & Computing, 35(2):149-177, 2026.
- Hricha Acharya, Zilin Jiang. Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult. Combinatorics, Probability & Computing, 35(2):207-229, 2026.
- Marc Distel. Proper minor-closed classes of graphs have Assouad-Nagata dimension 2. Combinatorics, Probability & Computing, 35(1):1-25, 2026.
- Andrew Suk, Ji Zeng. On higher dimensional point sets in general position. Combinatorics, Probability & Computing, 35(1):134-148, 2026.