External Links

    Journal: Combinatorica

    Volume 2, Issue 1

    1 -- 7Miklós Ajtai, János Komlós, Endre Szemerédi. Largest random component of a k-cube
    9 -- 13Peter J. Cameron. There are only finitely many finite distance-transitive graphs of given valency greater than two
    15 -- 23M. J. Dunwoody. Cutting up graphs
    25 -- 36Hans-Dietrich O. F. Gronau. On Sperner families in which no k sets have an empty intersection III
    37 -- 51Anthony J. W. Hilton. Canonical edge-colourings of locally finite graphs
    53 -- 62Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen. A nine point theorem for 3-connected graphs
    63 -- 69H. D. Macpherson. Infinite distance transitive graphs of finite valency
    71 -- 78G. A. Margulis. Explicit constructions of graphs without short cycles and low density codes
    79 -- 90Richard J. Nowakowski, Ivan Rival. On a class of isometric subgraphs of a graph
    91 -- 97Paul D. Seymour. Packing nearly-disjoint sets
    99 -- 101W. D. Wallis. Asymptotic values of clique partition numbers
    runs on