1. Ramsey-type Theorems with Forbidden Subgraphs

   • Noga Alon
   • János Pach
   • József Solymosi

   Original Paper Pages: 155 - 170

2. Vertex Covers by Edge Disjoint Cliques

   • Tom Bohman
   • Alan Frieze
   • Lubos Thoma

   Original Paper Pages: 171 - 197

3. On Bipartite Graphs with Linear Ramsey Numbers

   • R. L. Graham
   • V. Rödl
   • A. Ruciński

   Original Paper Pages: 199 - 209

4. Chromatic Numbers of Cayley Graphs on Z and Recurrence

   • Y. Katznelson

   Original Paper Pages: 211 - 219

5. Convex Sets in the Plane with Three of Every Four Meeting

   • Daniel J. Kleitman
   • András Gyárfás
   • Géza Tóth

   Original Paper Pages: 221 - 232

6. Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems

   • Péter Komjáth

   Original Paper Pages: 233 - 238

7. Tauberian Theorem of Erdős Revisited

   • J. Korevaar

   Original Paper Pages: 239 - 250

8. Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree \(\) and Large Girth

   • W. Mader

   Original Paper Pages: 251 - 265

9. The Erdős–Pósa Property for Odd Cycles in Highly Connected Graphs

   • Dieter Rautenbach
   • Bruce Reed

   Original Paper Pages: 267 - 278

10. Additive Completion of Lacunary Sequences

    • Imre Z. Ruzsa

    Original Paper Pages: 279 - 291

11. Another Look at the Erdős–Hajnal–Pósa Results on Partitioning Edges of the Rado Graph

    • Norbert Sauer

    Original Paper Pages: 293 - 308

12. Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property

    • Saharon Shelah

    Original Paper Pages: 309 - 319

13. The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity

    • Carsten Thomassen

    Original Paper Pages: 321 - 333