Combinatorica, Volume 24

Volume 24, Number 1, January 2004

• Tetsuya Abe:
  Sumsets Containing Powers of an Integer. 1-4
  Electronic Edition (link) BibTeX
• Béla Bollobás, Oliver Riordan:
  The Diameter of a Scale-Free Random Graph. 5-34
  Electronic Edition (link) BibTeX
• Anthony Bonato, Dejan Delic:
  On a Problem of Cameron's on Inexhaustible Graphs. 35-51
  Electronic Edition (link) BibTeX
• Jean-Marc Deshouillers, François Hennecart, Alain Plagne:
  On Small Sumsets in (Z/2Z)ⁿ. 53-68
  Electronic Edition (link) BibTeX
• Reinhard Diestel, Daniela Kühn:
  On Infinite Cycles I. 69-89
  Electronic Edition (link) BibTeX
• Reinhard Diestel, Daniela Kühn:
  On Infinite Cycles II. 91-116
  Electronic Edition (link) BibTeX
• Benjamin Doerr:
  Linear Discrepancy of Totally Unimodular Matrices. 117-125
  Electronic Edition (link) BibTeX
• Genghua Fan:
  Circular Chromatic Number and Mycielski Graphs. 127-135
  Electronic Edition (link) BibTeX
• Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani:
  Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem. 137-154
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Every Graph of Sufficiently Large Average Degree Contains a C₄-Free Subgraph of Large Average Degree. 155-162
  Electronic Edition (link) BibTeX
• Jirí Matousek:
  A Combinatorial Proof of Kneser's Conjecture. 163-170
  Electronic Edition (link) BibTeX

Volume 24, Number 2, April 2004

• Imre Bárány, Norihide Tokushige:
  The Minimum Area of Convex Lattice n-Gons. 171-185
  Electronic Edition (link) BibTeX
• Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov:
  On the Value of a Random Minimum Weight Steiner Tree. 187-207
  Electronic Edition (link) BibTeX
• Carlos A. Di Prisco, Jimena Llopis, Stevo Todorcevic:
  Parametrized Partitions of Products of Finite Sets. 209-232
  Electronic Edition (link) BibTeX
• Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
  Cuts, Trees and l₁-Embeddings of Graphs. 233-269
  Electronic Edition (link) BibTeX
• Neil Hindman, Randall McCutcheon:
  Partition Theorems for Left and Right Variable Words. 271-286
  Electronic Edition (link) BibTeX
• Daniela Kühn, Deryk Osthus:
  Induced Subdivisions In K_{s, s}-Free Graphs of Large Average Degree. 287-304
  Electronic Edition (link) BibTeX
• Uwe Leck:
  Nonexistence of a Kruskal-Katona Type Theorem for Subword Orders. 305-312
  Electronic Edition (link) BibTeX
• Dhruv Mubayi:
  An Explicit Construction for a Ramsey Problem. 313-324
  Electronic Edition (link) BibTeX
• Ján Nincák, Peter J. Owens:
  Note. 325-329
  Electronic Edition (link) BibTeX

Volume 24, Number 3, July 2004

• Jørgen Bang-Jensen, Anders Yeo:
  Decomposing k-arc-Strong Tournaments Into Strong Spanning Subdigraphs. 331-349
  Electronic Edition (link) BibTeX
• Christian Elsholtz:
  Lower Bounds For Multidimensional Zero Sums. 351-358
  Electronic Edition (link) BibTeX
• Christian Houdré, Prasad Tetali:
  Isoperimetric Invariants For Product Markov Chains and Graph Products. 359-388
  Electronic Edition (link) BibTeX
• Alexandr V. Kostochka, Vojtech Rödl:
  On Graphs With Small Ramsey Numbers, II. 389-401
  Electronic Edition (link) BibTeX
• Michael Krivelevich, Benny Sudakov, Tibor Szabó:
  Triangle Factors In Sparse Pseudo-Random Graphs. 403-426
  Electronic Edition (link) BibTeX
• Bodo Lass:
  Matching Polynomials And Duality. 427-440
  Electronic Edition (link) BibTeX
• Wolfgang Mader:
  High Connectivity Keeping Sets In n-Connected Graphs. 441-458
  Electronic Edition (link) BibTeX
• Klaus Metsch:
  Blocking Subspaces By Lines In PG(n, q). 459-486
  Electronic Edition (link) BibTeX
• Patrice Ossona de Mendez, Pierre Rosenstiehl:
  Transitivity And Connectivity Of Permutations. 487-501
  Electronic Edition (link) BibTeX
• Toniann Pitassi, Ran Raz:
  Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. 503-524
  Electronic Edition (link) BibTeX
• Michael E. Saks, Alex Samorodnitsky, Leonid Zosin:
  A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. 525-530
  Electronic Edition (link) BibTeX
• Lutz Volkmann:
  The Maximum Size Of Graphs With A Unique k- Factor. 531-540
  Electronic Edition (link) BibTeX

Volume 24, Number 4, September 2004

• Bernardo M. Ábrego, György Elekes, Silvia Fernández-Merchant:
  Structural Results For Planar Sets With Many Similar Subsets. 541-554
  Electronic Edition (link) BibTeX
• Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
  On Shadows Of Intersecting Families. 555-566
  Electronic Edition (link) BibTeX
• Richard Arratia, Béla Bollobás, Gregory B. Sorkin:
  A Two-Variable Interlace Polynomial. 567-584
  Electronic Edition (link) BibTeX
• Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
  Near Optimal Separation Of Tree-Like And General Resolution. 585-603
  Electronic Edition (link) BibTeX
• Jaroslaw Grytczuk, Andrzej P. Kisielewicz, Krzysztof Przeslawski:
  Minimal Partitions Of A Box Into Boxes. 605-614
  Electronic Edition (link) BibTeX
• Svante Janson, Andrzej Rucinski:
  The Deletion Method For Upper Tail Estimates. 615-640
  Electronic Edition (link) BibTeX
• Rong Luo, Wenan Zang, Cun-Quan Zhang:
  Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. 641-657
  Electronic Edition (link) BibTeX
• Roy Meshulam, Avi Wigderson:
  Expanders In Group Algebras. 659-680
  Electronic Edition (link) BibTeX
• Joseph A. Thas, Hendrik Van Maldeghem:
  Full Embeddings Of The Finite Dual Split Cayley Hexagons. 681-698
  Electronic Edition (link) BibTeX
• Carsten Thomassen:
  The Locally Connected Compact Metric Spaces Embeddable In The Plane. 699-718
  Electronic Edition (link) BibTeX
• Jacques Verstraëte:
  On The Number Of Sets Of Cycle Lengths. 719-730
  Electronic Edition (link) BibTeX
• Sanming Zhou:
  Almost Covers Of 2-Arc Transitive Graphs. 731-745
  Electronic Edition (link) BibTeX