External Links

    Journal: Combinatorica

    Volume 19, Issue 4

    453 -- 472Noga Alon, Michael Krivelevich, Benny Sudakov. List Coloring of Random and Pseudo-Random Graphs
    473 -- 486Béla Bollobás, Alex D. Scott. Exact Bounds for Judicious Partitions of Graphs
    487 -- 505Tomás Feder, Pavol Hell, Jing Huang. List Homomorphisms and Circular Arc Graphs
    507 -- 532Martin Grohe. Equivalence in Finite-Variable Logics is Complete for Polynomial Time
    533 -- 548Dmitry N. Kozlov. Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex
    549 -- 553László Pyber. A Bound for the Diameter of Distance-Regular Graphs
    555 -- 566Jiri Sgall. Bounds on Pairs of Families with Restricted Intersections
    567 -- 587Van H. Vu. Extremal Set Systems with Weakly Restricted Intersections
    589 -- 595Soojin Cho. On the Support Size of Null Designs of Finite Ranked Posets

    Volume 19, Issue 3

    301 -- 319László Babai, Anna Gál, Avi Wigderson. Superpolynomial Lower Bounds for Monotone Span Programs
    321 -- 333Sergei Evdokimov, Ilia N. Ponomarenko. Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks
    335 -- 373Oded Goldreich, Dana Ron. A Sublinear Bipartiteness Tester for Bounded Degree Graphs
    375 -- 401Frank Thomson Leighton, Bruce M. Maggs, Andréa W. Richa. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules
    403 -- 435Ran Raz, Pierre McKenzie. Separation of the Monotone NC Hierarchy
    437 -- 452Vojtech Rödl, Andrzej Rucinski. Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma

    Volume 19, Issue 2

    151 -- 174Marcelo H. de Carvalho, Cláudio Leonardo Lucchesi, Uppaluri S. R. Murty. Ear Decompositions of Matching Covered Graphs
    175 -- 220Alan M. Frieze, Ravi Kannan. Quick Approximation to Matrices and Applications
    221 -- 239David A. Grable. More-Than-Nearly-Perfect Packings and Partial Designs
    241 -- 254Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky. The Linear-Array Conjecture in Communication Complexity Is False
    255 -- 266Svante Linusson. The Number of M-Sequences and f-Vectors
    267 -- 296Bruce A. Reed. Mangoes and Blueberries
    297 -- 300Friedrich Eisenbrand. On the Membership Problem for the Elementary Closure of a Polyhedron

    Volume 19, Issue 1

    1 -- 15Rudolf Ahlswede, Levon H. Khachatrian. A Pushing-Pulling Method: New Proofs of Intersection Theorems
    17 -- 41Yefim Dinitz, Naveen Garg, Michel X. Goemans. On the Single-Source Unsplittable Flow Problem
    43 -- 53György Elekes. On Linear Combinatorics III. Few Directions and Distorted Lattices
    55 -- 63Peter Frankl, Norihide Tokushige. The Erdos-Ko-Rado Theorem for Integer Sequences
    65 -- 85Stasys Jukna. Combinatorics of Monotone Computations
    87 -- 109Kazuo Murota. Submodular Flow Problem with a Nonseparable Cost Function
    111 -- 124János Pach, Joel Spencer. Uniformly Distributed Distances - a Geometric Application of Janson s Inequality
    125 -- 138Avi Wigderson, David Zuckerman. Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
    139 -- 149Xuding Zhu. Graphs Whose Circular Chromatic Number Equals the Chromatic Number
    runs on