| 657 | -- | 674 | Gopal Goel, Andrew Ahn. Discrete derivative asymptotics of the β-Hermite eigenvalues |
| 675 | -- | 695 | Lina Jansson Andrén, Carl Johan Casselgren, Klas Markström. Restricted completion of sparse partial Latin squares |
| 696 | -- | 719 | Alexander I. Barvinok, Guus Regts. Weighted counting of solutions to sparse systems of equations |
| 720 | -- | 732 | Louis Esperet, Ross J. Kang, Stéphan Thomassé. Separation Choosability and Dense Bipartite Induced Subgraphs |
| 733 | -- | 739 | Peter Frankl. A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families |
| 740 | -- | 754 | Dong Yeap Kang, Sang-il Oum. Improper colouring of graphs with no odd clique minor |
| 755 | -- | 767 | Shinya Fujita 0001, Ruonan Li, Guanghui Wang. Decomposing edge-coloured graphs under colour degree constraints |
| 768 | -- | 776 | Allan Lo, Nicolás Sanhueza-Matamala. An asymptotic bound for the strong chromatic number |
| 777 | -- | 790 | Jacob Fox, László Miklós Lovász, Yufei Zhao. A fast new algorithm for weak graph regularity |
| 791 | -- | 810 | Kevin Hendrey, David R. Wood. Defective and clustered choosability of sparse graphs |