Journal: Combinatorica

Volume 3, Issue 3

243 -- 244Richard Rado. Paul Erdös is seventy years old
245 -- 246Ernst G. Straus. Paul Erdös at 70
281 -- 297József Beck. On the lattice property of the plane and some problems of Dirac, Motzkn and Erdös in combinatorial geometry
299 -- 304József Beck, Joel Spencer. Balancing matrices with line shifts
305 -- 313Ralf Bicker, Bernd Voigt. Density theorems for finitistic trees
315 -- 324Fan R. K. Chung, Ronald L. Graham. Edge-colored complete graphs with precisely colored subgraphs
325 -- 329Vasek Chvátal. Mastermind
331 -- 339Michel Deza, Peter Frankl, N. M. Singhi. On Functions of Strenth t
341 -- 350Peter Frankl, Zoltán Füredi. A new generation of the Erdös - Ko - Rado theorem
351 -- 358András Gyárfás, Jenö Lehel. Hypergraph families with bounded edge cover or transversal number
359 -- 374Bernhard Korte, László Lovász. Structural properties of greedoids
375 -- 380Alexander Schrijver. Bounds on the number of Eulerian orientations
381 -- 392Endre Szemerédi, William T. Trotter. Extremal problems in discrete geometry
393 -- 396Carsten Thomassen. Disjoint cycles in digraphs

Volume 3, Issue 2

141 -- 146Richard P. Anstee. Hypergraphs with no special cycles
147 -- 152Eiichi Bannai, Etsuko Bannai, Dennis Stanton. An upper bound for the cardinality of an s-distance subset in real Euclidean space, II
153 -- 165Norman Biggs, M. L. Hoare. The sextet construction for cubic graphs
167 -- 176Fan R. K. Chung, Paul Erdös. On unavoidable graphs
177 -- 179János Demetrovics, Gy. Gyepesi. A note on minimal matrix representation of closure operations
181 -- 192Paul Erdös, Miklós Simonovits. Supersaturated graphs and hypergraphs
193 -- 199Peter Frankl. An extremal set theoretical characterization of some Steiner systems
201 -- 206Mikio Kano. Cycle games and cycle cut games
207 -- 218M. V. Lomonosov. On the planar integer two-flow problem
219 -- 237Arnold Neumaier, J. J. Seidel. Discrete hyperbolic geometry
239 -- 241Joel Spencer. What s not inside a Cayley graph

Volume 3, Issue 1

1 -- 19Miklós Ajtai, János Komlós, Endre Szemerédi. Sorting in c log n parallel sets
21 -- 33H. Bauer, Bernhard Ganter, Ferdinand Hergert. Algebraic techniques for nonlinear codes
35 -- 52Gérard Cornuéjols, William R. Pulleyblank. Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem
53 -- 68William H. Cunningham. Decompostiton of submodular functions
69 -- 81Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi. More results on Ramsey - Turán Type problems
83 -- 93Ralph J. Faudree, Miklós Simonovits. On a class of degenerate extremal graph problems
95 -- 99Péter Hajnal. Partition of graphs with condition on the connectivity and minimum degree
101 -- 104Nathan Linial, Michael E. Saks, Vera T. Sós. Largest digraphs contained in all n-tournaments
105 -- 117László Lovász. Ear-decompositions of matching covered graphs
119 -- 121Svatopluk Poljak, Miroslav Sura. On periodical behavior in societies with symmetric influences
123 -- 131Eli Shamir. How many random edges make a graph Hamiltonian?
133 -- 134Carsten Thomassen. Cycles in graphs of uncountable chromatic number
135 -- 139Peter M. Winkler. Proof of the squashed cube conjecture