| 471 | -- | 486 | Peter Allen. Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles |
| 487 | -- | 494 | Itai Benjamini, Noam Berger, Ariel Yadin. Long-Range Percolation Mixing Time |
| 495 | -- | 509 | Charlotte A. C. Brennan, Arnold Knopfmacher, Stephan Wagner. The Distribution of Ascents of Size ::::d:::: or More in Partitions of ::::n:::: |
| 519 | -- | 536 | Roland Häggkvist, Anders Johansson. Orthogonal Latin Rectangles |
| 537 | -- | 548 | Gerard Hooghiemstra, Piet Van Mieghem. The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights |
| 549 | -- | 558 | Jerzy Jaworski, Dudley Stark. The Vertex Degree Distribution of Passive Random Intersection Graph Models |
| 559 | -- | 575 | J. Robert Johnson, John M. Talbot. ::::G::::-Intersection Theorems for Matchings and Other Graphs |
| 577 | -- | 589 | Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos. Graph Colouring with No Large Monochromatic Components |
| 591 | -- | 601 | Colin McDiarmid, Bruce A. Reed. On the Maximum Degree of a Random Planar Graph |
| 603 | -- | 618 | Alexander A. Razborov. On the Minimal Density of Triangles in Graphs |
| 619 | -- | 625 | József Solymosi, Csaba D. Tóth. On a Question of Bourgain about Geometric Incidences |