Combinatorica, Volume 6

Volume 6, Number 1, 1986

• László Babai:
  On Lovász' lattice reduction and the nearest lattice point problem. 1-13
  
• Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald:
  The asymptotic number of acyclic diagraphs I. 15-22
  
• Mostafa Blidia:
  A parity diagraph has a kernel. 23-27
  
• Ulrich Faigle, Bill Sands:
  A size-width inequality for distributive lattices. 29-33
  
• Richard M. Karp, Eli Upfal, Avi Wigderson:
  Constructing a perfect matching is in random NC. 35-48
  
• Nathan Linial:
  Legal coloring of graphs. 49-54
  
• Joel Spencer:
  Balancing vectors in the max norm. 55-66
  
• Mario Szegedy:
  The solution of Graham's greatest common divisor problem. 67-71
  
• Ioan Tomescu:
  On the number of paths and cycles for almost all graphs and digraphs. 73-79
  

Volume 6, Number 2, 1986

• Noga Alon:
  Eigenvalues and expanders. 83-96
  
• Manuel Blum:
  Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. 97-108
  
• Harold N. Gabow, Zvi Galil, Thomas H. Spencer, Robert Endre Tarjan:
  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. 109-122
  
• Harold N. Gabow, Matthias F. M. Stallmann:
  An augmenting path algorithm for linear matroid parity. 123-150
  
• Sergiu Hart, Micha Sharir:
  Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. 151-178
  
• Peter W. Shor:
  the average-case analysis of some on-line algorithms for bin packing. 179-200
  

Volume 6, Number 3, 1986

• Noga Alon:
  Covering graphs by the minimum number of equivalence relations. 201-206
  
• Noga Alon:
  Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory. 207-219
  
• Imre Bárány, Jack Edmonds, Laurence A. Wolsey:
  Packing and covering a tree by subtrees. 221-233
  
• Marc A. Berger, Alexander Felzenbaum, Aviezri S. Fraenkel:
  A non-analytic proof of the Newman - Znám result for disjoint covering systems. 235-343
  
• R. Bodendiek, Klaus W. Wagner:
  A characterization of the minimalbasis of the torus. 245-260
  
• Endre Boros, Tamás Szonyi:
  On the sharpness of a theorem of B. Segre. 261-268
  
• Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
  Contracible edges in triangle-free graphs. 269-274
  
• Michele Elia:
  On the non-existence of Barker sequences. 275-278
  
• Peter Frankl:
  Orthogonal vectors in the n-dimensional cube and codes with missing distances. 279-286
  

Volume 6, Number 4, 1986

• Thomas Andreae:
  On well-quasi-ordering finite graphs by immersion. 287-298
  
• Achim Bachem, Walter Kern:
  Adjoints of oriented matroids. 299-308
  
• D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald:
  Extremal clique coverings of complementary graphs. 309-314
  
• Collette R. Coullard:
  Counterexamples to conjectures on 4-connected matroids. 315-320
  
• Stephen Downes:
  A completion problem for finite affine planes. 321-325
  
• Ralph J. Faudree, Richard H. Schelp, Vera T. Sós:
  Some intersection theorems on two valued functions. 327-333
  
• Peter Frankl, Zoltán Füredi:
  Finite projective spaces and intersecting hypergraphs. 335-354
  
• Zoltán Füredi, Jerrold R. Griggs:
  Families of finite sets with minimum shadows. 355-363
  
• A. M. H. Gerards, Alexander Schrijver:
  Matrices with the Edmonds - Johnson property. 365-379
  
• Wen-Lian Hsu:
  Coloring planar perfect graphs by decomposition. 381-385
  
• Howard J. Karloff:
  A Las Vegas RNC algorithm for maximum matching. 387-391
  
• László Pyber:
  Clique covering of graphs. 393-398
  

Last update Thu May 23 18:27:59 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page