1. On optimal matchings

   • M. Ajtai
   • J. Komlós
   • G. Tusnády

   OriginalPaper Pages: 259 - 264

2. Cycles through ten vertices in 3-connected cubic graphs

   • M. N. Ellingham
   • D. A. Holton
   • C. H. C. Little

   OriginalPaper Pages: 265 - 273

3. Disjoint shortest paths in graphs

   • Hikoe Enomoto
   • Akira Saito

   OriginalPaper Pages: 275 - 279

4. Path-closed sets

   • Heinz Gröflin

   OriginalPaper Pages: 281 - 290

5. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”

   • M. Grötschel
   • L. Lovász
   • A. Schrijver

   OriginalPaper Pages: 291 - 295

6. A topological approach to evasiveness

   • Jeff Kahn
   • Michael Saks
   • Dean Sturtevant

   OriginalPaper Pages: 297 - 306

7. Lower bound of the hadwiger number of graphs by their average degree

   • A. V. Kostochka

   OriginalPaper Pages: 307 - 316

8. A class of dimension-skipping graphs

   • Igor Kříž

   OriginalPaper Pages: 317 - 319

9. On equidistant binary codes of lengthn=4k+1 with distanced=2k

   • J. H. van Lint

   OriginalPaper Pages: 321 - 323

10. Automorphisms of random graphs with specified vertices

    • B. D. McKay
    • N. C. Wormald

    OriginalPaper Pages: 325 - 338

11. The reconstruction problem for certain infinite graphs

    • Michael v. Rimscha

    OriginalPaper Pages: 339 - 343

12. On combinatorial properties of spheres in euclidean spaces

    • Vojtěch Rödl

    OriginalPaper Pages: 345 - 349

13. On automorphisms of infinite graphs with forbidden subgraphs

    • Norbert Seifter

    OriginalPaper Pages: 351 - 356

14. The equivalence of certain equidistant binary codes and symmetric bibds

    • D. R. Stinson
    • G. H. J. van Rees

    OriginalPaper Pages: 357 - 362

15. On the number of homogeneous subgraphs of a graph

    • L. A. Székely

    OriginalPaper Pages: 363 - 372

16. A new polynomial-time algorithm for linear programming

    • N. Karmarkar

    OriginalPaper Pages: 373 - 395