| 555 | -- | 572 | Ron Aharoni, Tomás Kaiser, Shira Zerbib. Fractional covers and matchings in families of weighted d-intervals |
| 573 | -- | 616 | Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person. Powers of Hamilton cycles in pseudorandom graphs |
| 617 | -- | 632 | József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh. The typical structure of graphs with no large cliques |
| 633 | -- | 650 | Alexander I. Barvinok, Pablo Soberón. Computing the partition function for graph homomorphisms |
| 651 | -- | 672 | Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos. Regular families of forests, antichains and duality pairs of relational structures |
| 673 | -- | 696 | Daniel Horsley. Generalising Fisher's inequality to coverings and packings |
| 697 | -- | 732 | Michael Krivelevich, Choongbum Lee, Benny Sudakov. Compatible Hamilton cycles in Dirac graphs |
| 733 | -- | 765 | Anton Malyshev, Igor Pak. Lifts, derandomization, and diameters of Schreier graphs of Mealy automata |
| 767 | -- | 784 | Vojtech Rödl, Andrzej Rucinski 0001, Mathias Schacht. An exponential-type upper bound for Folkman numbers |
| 785 | -- | 793 | Carsten Thomassen. Infinitely connected subgraphs in graphs of uncountable chromatic number |