External Links

    Journal: Combinatorica

    Volume 30, Issue 6

    617 -- 625Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner. The generalized almost resolvable cycle system problem
    627 -- 654Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger. On properties of random dissections and triangulations
    655 -- 680E. Rodney Canfield, Brendan D. McKay. Asymptotic enumeration of integer matrices with large equal row and column sums
    681 -- 714Reinhard Diestel, Philipp Sprüssel. The homology of a locally finite graph with ends
    715 -- 734Ken-ichi Kawarabayashi, Yusuke Kobayashi. Algorithms for finding an induced cycle in planar graphs
    735 -- 743Torsten Korneffel, Eberhard Triesch. An asymptotic bound for the complexity of monotone graph properties

    Volume 30, Issue 5

    485 -- 520Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang. Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
    521 -- 532Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel. Every rayless graph has an unfriendly partition
    533 -- 552Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan Mohar. Approximation algorithms via contraction decomposition
    553 -- 563Gábor Elek. On the limit of large girth graph sequences
    565 -- 580Shinya Fujita, Ken-ichi Kawarabayashi. Non-separating even cycles in highly connected graphs
    581 -- 615Manor Mendel, Assaf Naor. Maximum gradient embeddings and monotone clustering

    Volume 30, Issue 4

    359 -- 385George Androulakis, Stephen J. Dilworth, Nigel J. Kalton. A new approach to the Ramsey-type games and the Gowers dichotomy in ::::F::::-spaces
    387 -- 417Maria Chudnovsky, Paul D. Seymour. The three-in-a-tree problem
    419 -- 434Shawn Hedman, Wai Yan Pong. Locally finite homogeneous graphs
    435 -- 444Ernest E. Shult, Koen Thas. A theorem of Cohen on parapolar spaces
    445 -- 470Benny Sudakov, Jan Vondrák. A randomized embedding algorithm for trees
    471 -- 484Rade T. Zivaljevic. Oriented matroids and Ky Fan s theorem

    Volume 30, Issue 3

    257 -- 275Ronnie Barequet, Gill Barequet, Günter Rote. Formulae and growth rates of high-dimensional polycubes
    277 -- 293Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko. Hypergraphs with independent neighborhoods
    295 -- 326Hiroshi Hirai. Metric packing for ::::K::::::3::+::::K::::::3::
    327 -- 358Ryan O Donnell, Rocco A. Servedio. New degree bounds for polynomial threshold functions

    Volume 30, Issue 2

    125 -- 137Péter Csikvári. On a poset of trees
    139 -- 162Cécile Dartyge, András Sárközy, Mihály Szalay. On the pseudo-randomness of subsets related to primitive roots
    163 -- 174Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa. A superadditivity and submultiplicativity property for cardinalities of sumsets
    175 -- 200Peter Keevash, Dhruv Mubayi. Set systems without a simplex or a cluster
    201 -- 216Henry A. Kierstead, Alexandr V. Kostochka. Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture
    217 -- 224Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi. A fast algorithm for equitable coloring
    225 -- 237Van H. Vu. Structure of large incomplete sets in abelian groups
    239 -- 246Raphael Yuster. Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
    247 -- 252Satoru Fujishige. A note on disjoint arborescences
    253 -- 256Guo-Niu Han. New hook length formulas for binary trees

    Volume 30, Issue 1

    1 -- 24Ada Chan, Chris D. Godsil. Type-II matrices and combinatorial structures
    25 -- 45Stefaan De Winter, Jeroen Schillewaert. Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2
    47 -- 68Venkatesan Guruswami, James R. Lee, Alexander A. Razborov. Almost Euclidean subspaces of ::::l:::: ::1:::::::::N::::::: VIA expander codes
    69 -- 81Bill Jackson. An inequality for Tutte polynomials
    83 -- 104Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer. Partition properties of the dense local order and a colored version of Milliken s theorem
    105 -- 123Martin Marciniszyn, Reto Spöhel. Online vertex-coloring games in random graphs
    runs on