| 617 | -- | 618 | Graham Brightwell. Introduction |
| 619 | -- | 627 | Noga Alon. Economical Elimination of Cycles in the Torus |
| 629 | -- | 646 | József Balogh, Tom Bohman, Dhruv Mubayi. Erdos-Ko-Rado in Random Hypergraphs |
| 647 | -- | 681 | Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger. The Degree Sequence of Random Graphs from Subcritical Classes |
| 683 | -- | 689 | Andrzej Dudek, Peter Frankl, Vojtech Rödl. A Note on Universal and Canonically Coloured Sequences |
| 691 | -- | 705 | György Elekes, Miklós Simonovits, Endre Szabó. A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? |
| 707 | -- | 724 | Stefan Felsner, Kolja B. Knauer. ULD-Lattices and Delta-Bonds |
| 725 | -- | 729 | Zoltán Füredi, Lale Özkahya. On 14-Cycle-Free Subgraphs of the Hypercube |
| 731 | -- | 748 | Jerrold R. Griggs, Linyuan Lu. On Families of Subsets With a Forbidden Subposet |
| 749 | -- | 764 | L. Ilinca, Jeff Kahn. On the Number of 2-SAT Functions |
| 765 | -- | 774 | Hal A. Kierstead, Alexandr V. Kostochka. Efficient Graph Packing via Game Colouring |
| 775 | -- | 801 | Michael Krivelevich, Benny Sudakov, Dan Vilenchik. On the Random Satisfiable Process |
| 803 | -- | 818 | Hanno Lefmann, Yury Person, Vojtech Rödl, Mathias Schacht. On Colourings of Hypergraphs Without Monochromatic Fano Planes |
| 819 | -- | 834 | János Pach, Gábor Tardos. Conflict-Free Colourings of Graphs and Hypergraphs |
| 835 | -- | 860 | M. Sammer, Prasad Tetali. Concentration on the Discrete Torus Using Transportation |