| 155 | -- | 170 | Noga Alon, János Pach, József Solymosi. Ramsey-type Theorems with Forbidden Subgraphs |
| 171 | -- | 197 | Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma. Vertex Covers by Edge Disjoint Cliques |
| 199 | -- | 209 | Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski. On Bipartite Graphs with Linear Ramsey Numbers |
| 211 | -- | 219 | Y. Katznelson. Chromatic Numbers of Cayley Graphs on Z and Recurrence |
| 221 | -- | 232 | Daniel J. Kleitman, András Gyárfás, Géza Tóth. Convex Sets in the Plane with Three of Every Four Meeting |
| 233 | -- | 238 | Péter Komjáth. Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems |
| 239 | -- | 250 | Jacob Korevaar. Tauberian Theorem of Erdos Revisited |
| 251 | -- | 265 | Wolfgang Mader. Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n/epsilon and Large Girth |
| 267 | -- | 278 | Dieter Rautenbach, Bruce A. Reed. The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs |
| 279 | -- | 291 | Imre Z. Ruzsa. Additive Completion of Lacunary Sequences |
| 293 | -- | 308 | Norbert Sauer. Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph |
| 309 | -- | 319 | Saharon Shelah. Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property |
| 321 | -- | 333 | Carsten Thomassen. The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity |