| 383 | -- | 389 | Jacob Fox, Cosmin Pohoata. Sets without k-term progressions can have many shorter progressions |
| 390 | -- | 429 | Michael Anastos, Alan M. Frieze. Finding maximum matchings in random regular graphs in linear expected time |
| 430 | -- | 467 | Michael Drmota, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger. Node profiles of symmetric digital search trees: Concentration properties |
| 468 | -- | 479 | Lior Gishboliner, Asaf Shapira, Henrique Stagni. Testing linear inequalities of subgraph statistics |
| 480 | -- | 516 | Jie Han 0002, Patrick Morris 0001, Andrew Treglown. Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu |
| 517 | -- | 605 | Konstantin E. Tikhomirov, Pierre Youssef. Outliers in spectrum of sparse Wigner matrices |