| 307 | -- | 314 | Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe. A Construction for Clique-Free Pseudorandom Graphs |
| 315 | -- | 344 | Asaf Ferber, Vishesh Jain, Benny Sudakov. Number of 1-Factorizations of Regular High-Degree Graphs |
| 345 | -- | 362 | Alexander L. Gavrilyuk, Sho Suda, Janos Vidali. On Tight 4-Designs in Hamming Association Schemes |
| 363 | -- | 403 | Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus. On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems |
| 405 | -- | 433 | Ervin Györi, Michael D. Plummer, Dong Ye 0002, Xiaoya Zha. Cycle Traversability for Claw-Free Graphs and Polyhedral Maps |
| 435 | -- | 454 | Gergely Harcos, Daniel Soltész. New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs |