Combinatorica, Volume 2

Volume 2, Number 1, 1982

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

R. D. Baker: Symmetric designs with Bruck subdesigns. 103-109
József Beck: Irregularities of two-colourings of the NxN square lattice. 111-123
Béla Bollobás, Wenceslas Fernandez de la Vega: The diameter of random regular graphs. 125-134
Raul Cordovil: On Reid's 3-simplicial matroid theorem. 135-141
Yahya Ould Hamidoune: A note on the girth of digraphs. 143-147
Derek A. Holton, Charles H. C. Little: Regular odd rings and non-planar graphs. 149-152
Ferenc Juhász: The asymptotic behaviour of Lovász' theta-function for random graphs. 153-155
R. Kemp: On the average oscillation of a stack. 157-176
Peter Kirschenhofer, Helmut Prodinger: On the average hyperoscillations of planted plane trees. 177-186
Alexandr V. Kostochka: A class of constructions for Turán's (3, 4) problem. 187-192
Vladimír Müller, Vojtech Rödl: Monotone paths in ordered graphs. 193-201

László Lovász: Tibor Gallai. 203-205
Paul Erdös: Personal reminiscences and remarks on the mathematical work of Tibor Gallai. 207-212
Claude Berge: Diperfect graphs. 213-222
Béla Bollobás: Long paths in sparse random graphs. 223-228
François Bry, Michel Las Vergnas: The Edmonds - Gallai decomposition for matchings in locally finite graphs. 229-235
Ludwig Danzer, Branko Grünbaum: Intersection properties of boxes in R^d. 237-246
J. Edmonds, László Lovász, William R. Pulleyblank: Brick decompositions and the matching rank of graphs. 247-274
Paul Erdös, Miklós Simonovits: Compactness results in extremal graph theory. 275-288
Paul Erdös, Vera T. Sós: On Ramsey - Turán type theorems for hypergraphs. 289-295
Rudolf Halin: Some remarks on interval graphs. 297-304
Jenö Lehel: Covers in hypergraphs. 305-309
Richard Rado: Atoms of families of sets. 311-314
Michael Stiebitz: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. 315-323
W. T. Tutte: The method of alternating paths. 325-332

Andries E. Brouwer: The uniqueness of the near hexagon on 729 points. 333-340
Michel Deza, Peter Frankl: On the vector space of 0-configurations. 341-345
Trevor I. Fenner, Alan M. Frieze: On the connectivity of random m-orientable graphs and digraphs. 347-359
András Frank: Disjoint paths in a rectilinear grid. 361-371
Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans: On 3-skein isomorphisms of graphs. 373-376
Vojtech Rödl: Nearly bipartite graphs with large chromatic number. 377-383
Laurence A. Wolsey: An analysis of the greedy algorithm for the submodular set covering problem. 385-393
Leszek S. Zaremba, S. Perz: On a geometric property of perfect graphs. 395-398