1. Largest random component of ak-cube

   • M. Ajtai
   • J. Komlós
   • E. Szemerédi

   OriginalPaper Pages: 1 - 7

2. There are only finitely many finite distance-transitive graphs of given valency greater than two

   • Peter J. Cameron

   OriginalPaper Pages: 9 - 13

3. Cutting up graphs

   • M. J. Dunwoody

   OriginalPaper Pages: 15 - 23

4. On sperner families in which nok sets have an empty intersection III

   • H. -D. O. F. Gronau

   OriginalPaper Pages: 25 - 36

5. Canonical edge-colourings of locally finite graphs

   • A. J. W. Hilton

   OriginalPaper Pages: 37 - 51

6. A nine point theorem for 3-connected graphs

   • D. A. Holton
   • B. D. McKay
   • C. Thomassen

   OriginalPaper Pages: 53 - 62

7. Infinite distance transitive graphs of finite valency

   • H. D. Macpherson

   OriginalPaper Pages: 63 - 69

8. Explicit constructions of graphs without short cycles and low density codes

   • G. A. Margulis

   OriginalPaper Pages: 71 - 78

9. On a class of isometric subgraphs of a graph

   • R. Nowakowski
   • I. Rival

   OriginalPaper Pages: 79 - 90

10. Packing nearly-disjoint sets

    • P. D. Seymour

    OriginalPaper Pages: 91 - 97

11. Asymptotic values of clique partition numbers

    • W. D. Wallis

    OriginalPaper Pages: 99 - 101