1. On an obstruction for perfect matchings

   • Ron Aharoni

   OriginalPaper Pages: 1 - 6

2. Diameters of random bipartite graphs

   • Béla Bollobás
   • Victor Klee

   OriginalPaper Pages: 7 - 19

3. Intersecting sperner families and their convex hulls

   • Péter L. Erdős
   • Peter Frankl
   • Gyula O. H. Katona

   OriginalPaper Pages: 21 - 34

4. Independence, clique size and maximum degree

   • Siemion Fajtlowicz

   OriginalPaper Pages: 35 - 38

5. On disjointly representable sets

   • Peter Frankl
   • János Pach

   OriginalPaper Pages: 39 - 45

6. What must and what need not be contained in a graph of uncountable chromatic number?

   • András Hajnal
   • Péter Komjáth

   OriginalPaper Pages: 47 - 52

7. Explicit construction of regular graphs without small cycles

   • Wilfried Imrich

   OriginalPaper Pages: 53 - 59

8. On random mapping patterns

   • A. Meir
   • J. W. Moon

   OriginalPaper Pages: 61 - 70

9. Sparse ramsey graphs

   • Jaroslav Nešetřil
   • Vojtěch Rödl

   OriginalPaper Pages: 71 - 78

10. On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems

    • Kevin T. Phelps
    • Vojtěch Rödl

    OriginalPaper Pages: 79 - 88

11. Perfect matchings in hexagonal systems

    • Horst Sachs

    OriginalPaper Pages: 89 - 99

12. On restricted colourings ofK _n

    • Miklós Simonovits
    • Vera T. Sós

    OriginalPaper Pages: 101 - 110

13. Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices

    • Zsolt Tuza

    OriginalPaper Pages: 111 - 116

14. Regressions and monotone chains: A ramsey-type extremal problem for partial orders

    • D. B. West
    • W. T. Trotter Jr.
    • P. Shor

    OriginalPaper Pages: 117 - 119