| 811 | -- | 848 | Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Philipp Loick. Optimal group testing |
| 849 | -- | 893 | Svante Janson. Tree limits and limits of random trees |
| 894 | -- | 898 | Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov. Powers of paths in tournaments |
| 899 | -- | 904 | Sean Eberhard, Jeff Kahn, Bhargav Narayanan, Sophie Spirkl. On symmetric intersecting families of vectors |
| 905 | -- | 921 | Martin E. Dyer, Marc Heinrich, Mark Jerrum, Haiko Müller. Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs |
| 922 | -- | 929 | Ben Green 0001, Aled Walker. Extremal problems for GCDs |
| 930 | -- | 941 | Bodan Arsovski. Additive bases via Fourier analysis |
| 942 | -- | 955 | Matija Bucic, Nemanja Draganic, Benny Sudakov. Universal and unavoidable graphs |
| 956 | -- | 981 | Leonid Gurvits, Jonathan Leake. Counting matchings via capacity-preserving operators |
| 982 | -- | 987 | István Tomon, Dmitriy Zakharov. Turán-type results for intersection graphs of boxes |