| 1 | -- | 7 | Ron Aharoni. On an obstruction for perfect matching |
| 7 | -- | 19 | Béla Bollobás, Victor Klee. Diameters of random bipartite graphs |
| 21 | -- | 34 | Péter L. Erdös, Peter Frankl, Gyula O. H. Katona. Intersecting Sperner families and their convex hulls |
| 35 | -- | 38 | Siemion Fajtlowicz. Independence, clique size and maximum degree |
| 39 | -- | 45 | Peter Frankl, János Pach. On disjointly representable sets |
| 47 | -- | 52 | András Hajnal, Péter Komjáth. What must and what need not be contained in a graph of uncountable chromatic number? |
| 53 | -- | 59 | Wilfried Imrich. Explicit construction of regular graphs without small cycles |
| 61 | -- | 70 | Amram Meir, John W. Moon. On random mapping patterns |
| 71 | -- | 78 | Jaroslav Nesetril, Vojtech Rödl. Sparse Ramsey graphs |
| 79 | -- | 88 | Kevin T. Phelps, Vojtech Rödl. On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems |
| 89 | -- | 99 | Horst Sachs. Perfect matchings in hexagonal systems |
| 101 | -- | 110 | Miklós Simonovits, Vera T. Sós. On restricted colourings of K::n:: |
| 111 | -- | 116 | Zsolt Tuza. Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices |
| 117 | -- | 119 | Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor. Regressions and monotone chains: a ramsey - type extermal problem for partial orders |