Combinatorica, Volume 1

Volume 1, Number 1, 1981

Miklós Ajtai, János Komlós, Endre Szemerédi: The longest path in a random graph. 1-12
Fan R. K. Chung, Paul Erdös, Ronald L. Graham: Minimal decompositions of graphs into mutually isomorphic subgraphs. 13-24
Paul Erdös: On the combinatorial problems which I would most like to see solved. 25-42
Heinz Gröflin, Alan J. Hoffman: On matroid intersections. 43-47
Daniel J. Kleitman, Kenneth J. Winston: Forests and score vectors. 49-54
Shuo-Yen Robert Li, Wen-Ch'ing Winnie Li: Independence numbers of graphs and generators of ideals. 55-61
Jacobus H. van Lint, Alexander Schrijver: Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields. 63-73
Paul D. Seymour: Reconizing graphic matroids. 75-78
W. T. Tutte: Graph factors. 79-97

Eiichi Bannai, Etsuko Bannai: An upper bound for the cardinality of an s-distance subset in real Euclidean space. 99-102
József Beck: Van der Waerden and Ramsey type games. 103-116
J. A. Bondy, László Lovász: Cycles through specified vertices of a graph. 117-140
Paul Erdös, Siemion Fajtlowicz: On the conjecture of Hajós. 141-143
András Frank: How to make a digraph strongly connected. 145-153
Zoltán Füredi: Maximum degree and fractional matchings in uniform hypergraphs. 155-162
C. D. Godsil: Equiarboreal graphs. 163-167
Martin Grötschel, László Lovász, Alexander Schrijver: The ellipsoid method and its consequences in combinatorial optimization. 169-197
Jaroslav Nesetril, Vojtech Rödl: Simple proof of the existence of restricted Ramsey graphs by means of a partite construction. 199-202
Joel Spencer: Suresums. 203-208

József Beck: Balancing families of integer sequences. 209-216
C. Berge, C. C. Chen, Vasek Chvátal, C. S. Seow: Combinatorial properties of polyominoes. 217-224
Michel Deza, Peter Frankl: Every large set of equidistant (0, +1, -1)-vectors forms a sunflower. 225-231
Zoltán Füredi, János Komlós: The eigenvalues of random symmetric matrices. 233-241
C. D. Godsil: On the full automorphism group of a graph. 243-256
C. D. Godsil: Hermite polynomials and a duality relation for matchings polynomials. 257-262
Ervin Györi: Partition conditions and vertex-connectivity of graphs. 263-273
Peter L. Hammer, Bruno Simeone: The splittance of a graph. 275-284
Heinz Adolf Jung: A note on fragments of infinite graphs. 285-288
Paul J. Schellenberg, Douglas R. Stinson, Scott A. Vanstone, J. W. Yates: The existence of Howell designs of side n+1 and order 2n. 289-301
Joel Spencer: Extremal problems, partition theorems, symmetric hypergraphs. 303-307
Richard Weiss: The nonexistence of 8-transitive graphs. 309-312

Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi: On Turáns theorem for sparse graphs. 313-317
József Beck: Roth's estimate of the discrepancy of integer sequences is nearly sharp. 319-325
József Beck: Balanced two-colorings of finite sets in the square I. 327-335
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Longest paths in digraphs. 337-341
Peter J. Cameron: Normal subgroups of infinite multiply transitive permutation groups. 343-347
Wenceslas Fernandez de la Vega, George S. Lueker: Bin packing can be solved within 1+epsilon in linear time. 349-355
Peter Frankl, Richard M. Wilson: Intersection theorems with geometric consequences. 357-368
C. D. Godsil: Matching behaviour is asymptotically normal. 369-376
Ervin Györi: An n-dimensional search problem with restricted questions. 377-380
Daniel J. Kleitman, James B. Shearer, Dean Sturtevant: Intersections of k-element sets. 381-384
Wolfgang Mader: On a property of n-edge-connected digraphs. 385-386
Paul D. Seymour: On minors of non-binary matroids. 387-394