Journal: Combinatorica

Volume 1, Issue 4

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

Volume 1, Issue 3

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

Volume 1, Issue 2

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

Volume 1, Issue 1

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