Intersecting sperner families and their convex hulls Péter L. ErdősPeter FranklGyula O. H. Katona OriginalPaper Pages: 21 - 34
What must and what need not be contained in a graph of uncountable chromatic number? András HajnalPéter Komjáth OriginalPaper Pages: 47 - 52
Explicit construction of regular graphs without small cycles Wilfried Imrich OriginalPaper Pages: 53 - 59
On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems Kevin T. PhelpsVojtěch Rödl OriginalPaper Pages: 79 - 88
Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices Zsolt Tuza OriginalPaper Pages: 111 - 116
Regressions and monotone chains: A ramsey-type extremal problem for partial orders D. B. WestW. T. Trotter Jr.P. Shor OriginalPaper Pages: 117 - 119