Combinatorica, Volume 21

Volume 21, Number 1, 2001

• Ron Aharoni:
  Ryser's Conjecture for Tripartite 3-Graphs. 1-4
  Electronic Edition (Springer LINK) BibTeX
• Richard Cole, Kirstin Ost, Stefan Schirra:
  Edge-Coloring Bipartite Multigraphs in O(E log D) Time. 5-12
  Electronic Edition (Springer LINK) BibTeX
• Penny E. Haxell, Vojtech Rödl:
  Integer and Fractional Packings in Dense Graphs. 13-38
  Electronic Edition (Springer LINK) BibTeX
• Kamal Jain:
  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. 39-60
  Electronic Edition (Springer LINK) BibTeX
• László Lipták, László Lovász:
  Critical Facets of the Stable Set Polytope. 61-88
  Electronic Edition (Springer LINK) BibTeX
• Roy Meshulam:
  The Clique Complex and Hypergraph Matching. 89-94
  Electronic Edition (Springer LINK) BibTeX
• Friedhelm Meyer auf der Heide, Christian Scheideler:
  Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. 95-138
  Electronic Edition (Springer LINK) BibTeX
• Balázs Szegedy:
  Tilings of the Square With Similar Right Triangles. 139-144
  Electronic Edition (Springer LINK) BibTeX
• Tamás Fleiner:
  Note - Uncrossing a Family of Set-Pairs. 145-150
  Electronic Edition (Springer LINK) BibTeX

Volume 21, Number 2, 2001

• Noga Alon, János Pach, József Solymosi:
  Ramsey-type Theorems with Forbidden Subgraphs. 155-170
  Electronic Edition (Springer LINK) BibTeX
• Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
  Vertex Covers by Edge Disjoint Cliques. 171-197
  Electronic Edition (Springer LINK) BibTeX
• Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski:
  On Bipartite Graphs with Linear Ramsey Numbers. 199-209
  Electronic Edition (Springer LINK) BibTeX
• Y. Katznelson:
  Chromatic Numbers of Cayley Graphs on Z and Recurrence. 211-219
  Electronic Edition (Springer LINK) BibTeX
• Daniel J. Kleitman, András Gyárfás, Géza Tóth:
  Convex Sets in the Plane with Three of Every Four Meeting. 221-232
  Electronic Edition (Springer LINK) BibTeX
• Péter Komjáth:
  Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems. 233-238
  Electronic Edition (Springer LINK) BibTeX
• J. Korevaar:
  Tauberian Theorem of Erdos Revisited. 239-250
  Electronic Edition (Springer LINK) BibTeX
• Wolfgang Mader:
  Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. 251-265
  Electronic Edition (Springer LINK) BibTeX
• Dieter Rautenbach, Bruce A. Reed:
  The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs. 267-278
  Electronic Edition (Springer LINK) BibTeX
• Imre Z. Ruzsa:
  Additive Completion of Lacunary Sequences. 279-291
  Electronic Edition (Springer LINK) BibTeX
• Norbert Sauer:
  Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph. 293-308
  Electronic Edition (Springer LINK) BibTeX
• Saharon Shelah:
  Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property. 309-319
  Electronic Edition (Springer LINK) BibTeX
• Carsten Thomassen:
  The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity. 321-333
  Electronic Edition (Springer LINK) BibTeX

Volume 21, Number 3, 2001

• Maria Axenovich, André Kündgen:
  On a Generalized Anti-Ramsey Problem. 335-349
  Electronic Edition (Springer LINK) BibTeX
• Stanislav Jendrol, Ingo Schiermeyer:
  On a Max-min Problem Concerning Weights of Edges. 351-359
  Electronic Edition (Springer LINK) BibTeX
• Odile Marcotte:
  Optimal Edge-Colourings for a Class of Planar Multigraphs. 361-394
  Electronic Edition (Springer LINK) BibTeX
• Bojan Mohar:
  Existence of Polyhedral Embeddings of Graphs. 395-401
  Electronic Edition (Springer LINK) BibTeX
• Oleg Pikhurko:
  Size Ramsey Numbers of Stars Versus 3-chromatic Graphs. 403-412
  Electronic Edition (Springer LINK) BibTeX
• Károly Podoski:
  Groups Covered by an Infinite Number of Abelian Subgroups. 413-416
  Electronic Edition (Springer LINK) BibTeX
• Carsten Thomassen:
  Totally Odd K₄-subdivisions in 4-chromatic Graphs. 417-443
  Electronic Edition (Springer LINK) BibTeX
• Tamás Fleiner:
  The Size of 3-Cross-Free Families. 445-448
  Electronic Edition (Springer LINK) BibTeX
• Gohar M. M. Kyureghyan:
  note: On a Degree Property of Cross-Intersecting Families. 449-453
  Electronic Edition (Springer LINK) BibTeX

Volume 21, Number 4, 2001

• László Babai, Thomas P. Hayes, Peter G. Kimmel:
  The Cost of the Missing Bit: Communication Complexity with Help. 455-488
  Electronic Edition (Springer LINK) BibTeX
• Christian Houdré:
  Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains. 489-513
  Electronic Edition (Springer LINK) BibTeX
• Alexandr V. Kostochka, Douglas R. Woodall:
  Density Conditions for Panchromatic Colourings of Hypergraphs. 515-541
  Electronic Edition (Springer LINK) BibTeX
• Monique Laurent:
  On the Sparsity Order of a Graph and Its Deficiency in Chordality. 543-570
  Electronic Edition (Springer LINK) BibTeX
• Guglielmo Lunardon:
  Linear k-blocking Sets. 571-581
  Electronic Edition (Springer LINK) BibTeX
• Roman Nedela, Martin Skoviera:
  Cayley Snarks and Almost Simple Groups. 583-590
  Electronic Edition (Springer LINK) BibTeX
• Yonutz Stanchescu:
  An Upper Bound for d-dimensional Difference Sets. 591-595
  Electronic Edition (Springer LINK) BibTeX