| 498 | -- | 512 | János Pach, Gábor Tardos, Géza Tóth 0001. Disjointness graphs of segments in the space |
| 513 | -- | 525 | Tom Johnston, Alex D. Scott. Lipschitz bijections between boolean functions |
| 526 | -- | 549 | Vytautas Gruslys, Shoham Letzter. Cycle partitions of regular graphs |
| 550 | -- | 569 | Per Kristian Lehre, Carsten Witt. Tail bounds on hitting times of randomized search heuristics using variable drift analysis |
| 570 | -- | 590 | Jie Han 0002, Yoshiharu Kohayakawa, Yury Person. Near-perfect clique-factors in sparse pseudorandom graphs |
| 591 | -- | 608 | W. T. Gowers 0001, Barnabás Janzer. Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques |
| 609 | -- | 618 | József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender. Making Kr+1-free graphs r-partite |
| 619 | -- | 630 | Joshua Erde, Mihyun Kang, Michael Krivelevich. Large complete minors in random subgraphs |
| 631 | -- | 653 | Stefan Glock, Stephen Gould, Felix Joos, Daniela Kühn, Deryk Osthus. Counting Hamilton cycles in Dirac hypergraphs |