1. Computing the genus of the 2-amalgamations of graphs

   • R. W. Decker
   • H. H. Glover
   • J. P. Huneke

   OriginalPaper Pages: 271 - 282

2. Some remarks on universal graphs

   • Reinhard Diestel
   • Rudolf Halin
   • Walter Vogler

   OriginalPaper Pages: 283 - 293

3. On the existence of two non-neighboring subgraphs in a graph

   • M. El-Zahar
   • P. Erdős

   OriginalPaper Pages: 295 - 300

4. About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

   • Konrad Engel
   • Nikolaj Nikolajevič Kuzjurin

   OriginalPaper Pages: 301 - 309

5. Multipartite graph—Sparse graph Ramsey numbers

   • P. Erdős
   • R. J. Faudree
   • R. H. Schelp

   OriginalPaper Pages: 311 - 318

6. A problem of P. Seymour on nonbinary matroids

   • Jeff Kahn

   OriginalPaper Pages: 319 - 323

7. Families of cuts with the MFMC-property

   • A. V. Karzanov

   OriginalPaper Pages: 325 - 335

8. An inequality conjectured by Hajela and Seymour arising in combinatorial geometry

   • H. J. Landau
   • B. F. Logan
   • L. A. Shepp

   OriginalPaper Pages: 337 - 342

9. Proof of a conjecture of Kahn for non-binary matroids

   • James G. Oxley

   OriginalPaper Pages: 343 - 345

10. Regular subgraphs of dense graphs

    • L. Pyber

    OriginalPaper Pages: 347 - 349

11. On a problem of Erdős and Larson

    • S. S. Shrikhande
    • N. M. Singhi

    OriginalPaper Pages: 351 - 358

12. Maximal tight sets and the edmonds—Gallai decomposition for matchings

    • K. Steffens

    OriginalPaper Pages: 359 - 365

13. Sequential access in splay trees takes linear time

    • R. E. Tarjan

    OriginalPaper Pages: 367 - 378