1. The directed packing numbersDD(t, v, v), t≧4

   • J. E. Dawson
   • D. B. Skillicorn
   • Jennifer Seberry

   OriginalPaper Pages: 121 - 130

2. n points in the plane can determinen ^3/2 unit circles

   • G. Elekes

   OriginalPaper Pages: 131 - 131

3. An Erdös-Ko-Rado theorem for the subcubes of a cube

   • Konrad Engel

   OriginalPaper Pages: 133 - 140

4. Families of finite sets with three intersections

   • Peter Frankl

   OriginalPaper Pages: 141 - 148

5. Hypergraphs do not jump

   • Peter Frankl
   • Vojtěch Rödl

   OriginalPaper Pages: 149 - 159

6. Hypergraphs in which all disjoint pairs have distinct unions

   • Zoltán Füredi

   OriginalPaper Pages: 161 - 168

7. Isomorphic factorizations VIII: Bisectable trees

   • Frank Harary
   • Robert W. Robinson

   OriginalPaper Pages: 169 - 179

8. A polyomino with no stochastic function

   • Jeffry Kahn
   • Michael Saks

   OriginalPaper Pages: 181 - 182

9. On coloring graphs with locally small chromatic number

   • H. A. Kierstead
   • E. Szemerédi
   • W. T. Trotter Jr.

   OriginalPaper Pages: 183 - 185

10. On the intersections of circuits and cocircuits in matroids

    • James G. Oxley

    OriginalPaper Pages: 187 - 195

11. Geodetic blocks of diameter three

    • K. R. Parthasarathy
    • N. Srinivasan

    OriginalPaper Pages: 197 - 206

12. H-extension of graphs

    • S. C. Shee
    • H. H. Teh

    OriginalPaper Pages: 207 - 211

13. Measurable chromatic number of geometric graphs and sets without some distances in euclidean space

    • L. A. Székely

    OriginalPaper Pages: 213 - 218

14. Canonization theorems for finite affine and linear spaces

    • B. Voigt

    OriginalPaper Pages: 219 - 239

15. Girths of bipartite sextet graphs

    • Alfred Weiss

    OriginalPaper Pages: 241 - 245

16. The exact bound in the Erdös-Ko-Rado theorem

    • Richard M. Wilson

    OriginalPaper Pages: 247 - 257