Journal: Combinatorica

Volume 26, Issue 6

627 -- 645Noga Alon, Asaf Shapira. On An Extremal Hypergraph Problem Of Brown, Erdös And Sós
647 -- 681Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson. Reducing The Seed Length In The Nisan-Wigderson Generator
683 -- 708Jeong Han Kim, Van H. Vu. Generating Random Regular Graphs
709 -- 732Joseph A. Thas, Koen Thas. Translation Generalized Quadrangles In Even Characteristic
733 -- 742Mark Jerrum. Two Remarks Concerning Balanced Matroids
743 -- 745Ian M. Wanless. Addendum To Schrijver s Work On Minimum Permanents

Volume 26, Issue 5

495 -- 519Yonatan Bilu, Nathan Linial. Lifts, Discrepancy and Nearly Optimal Spectral Gap*
521 -- 532Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour. Packing Non-Zero A-Paths In Group-Labelled Graphs
533 -- 558Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli. Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
559 -- 576János Pach, Géza Tóth. How Many Ways Can One Draw A Graph?
577 -- 585Wesley Pegden. Distance Sequences In Locally Infinite Vertex-Transitive Digraphs
587 -- 626Gábor Simonyi, Gábor Tardos. Local Chromatic Number, KY Fan s Theorem, And Circular Colorings

Volume 26, Issue 4

379 -- 394Angela Aguglia, Gábor Korchmáros. Blocking Sets Of External Lines To A Conic In ::::PG::::(2, ::::q::::), ::::q:::: ODD
395 -- 410Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer. Random Subgraphs Of Finite Graphs: III. The Phase Transition For The ::::n::::-Cube
411 -- 429Alexander Gamburd, Igor Pak. Expansion Of Product Replacement Graphs
431 -- 443C. D. Godsil, M. W. Newman. Independent Sets In Association Schemes
445 -- 453David J. Grynkiewicz. A Weighted Erdös-Ginzburg-Ziv Theorem
455 -- 473Christian Houdré, T. Stoyanov. Expansion And Isoperimetric Constants For Product Graphs
475 -- 487Nathan Linial, Roy Meshulam. Homological Connectivity Of Random 2-Complexes
489 -- 493Tomasz Luczak. On The Structure Of Triangle-Free Graphs Of Large Minimum Degree

Volume 26, Issue 3

255 -- 275Joseph Cheriyan, Santosh Vempala, Adrian Vetta. Network Design Via Iterative Rounding Of Setpair Relaxations
277 -- 314Matthias Kriesell. Mader s Conjecture On Extremely Critical Graphs
315 -- 332Dhruv Mubayi, Vojtech Rödl. Supersaturation For Ramsey-Turán Problems
333 -- 351Tibor Szabó, Gábor Tardos. Extremal Problems For Transversals In Graphs With Bounded Degree
353 -- 377Balázs Szegedy, Christian Szegedy. Symplectic Spaces And Ear-Decomposition Of Matroids

Volume 26, Issue 2

121 -- 131Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen. Density Conditions For Triangles In Multipartite Graphs
133 -- 139Graham Brightwell, Jan van den Heuvel, Leen Stougie. A Linear Bound On The Diameter Of The Transportation Polytope
141 -- 167Michael R. Fellows, Jens Gramm, Rolf Niedermeier. On The Parameterized Intractability Of Motif Search Problems
169 -- 182Veselin Jungic, Daniel Král, Riste Skrekovski. Colorings Of Plane Graphs With No Rainbow Faces
183 -- 205Claude Laflamme, Norbert W. Sauer, Vojkan Vuksanovic. Canonical Partitions Of Universal Structures
207 -- 230Seth Pettie. An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification
231 -- 253Norbert W. Sauer. Coloring Subgraphs of the Rado Graph

Volume 26, Issue 1

1 -- 16Noga Alon, Raphael Yuster. The Number Of Orientations Having No Fixed Tournament
17 -- 36Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell. Global Connectivity And Expansion: Long Cycles and Factors In ::::f::::-Connected Graphs
37 -- 46Peter Frankl, Norihide Tokushige. Weighted Non-Trivial Multiply Intersecting Families
47 -- 64Robert Hochberg. Large Discrepancy In Homogenous Quasi-Arithmetic Progressions
65 -- 82Ákos Kisvölcsey. Flattening Antichains
83 -- 89Martin Kochol. Restrictions On Smallest Counterexamples To The 5-Flow Conjecture
91 -- 99Jirí Matousek. The Number Of Unique-Sink Orientations of the Hypercube*
101 -- 120Christos H. Papadimitriou, Santosh Vempala. On The Approximability Of The Traveling Salesman Problem