External Links

    Journal: Combinatorica

    Volume 35, Issue 6

    641 -- 653Funda Ergün, Hossein Jowhari. On the monotonicity of a data stream
    655 -- 668Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie. On order and rank of graphs
    669 -- 694R. Bruce Richter, Brendan Rooney. Embedding a graph-like continuum in a surface
    695 -- 701Tomasz Schoen. New bounds in Balog-Szemerédi-Gowers theorem
    703 -- 747Emanuele Viola. The communication complexity of addition

    Volume 35, Issue 5

    513 -- 551Cesar Ceballos, Francisco Santos, Günter M. Ziegler. Many non-equivalent realizations of the associahedron
    553 -- 571Matt DeVos, Bojan Mohar, Robert Sámal. Highly arc-transitive digraphs - Structure and counterexamples
    573 -- 618David Ellis, Yuval Filmus, Ehud Friedgut. A quasi-stability result for dictatorships in S n
    619 -- 631Richard Hoshino, Ken-ichi Kawarabayashi. The edge density of critical digraphs
    633 -- 640Eckhard Steffen. Intersecting 1-factors and nowhere-zero 5-flows

    Volume 35, Issue 4

    389 -- 412Maria Chudnovsky, Paul D. Seymour. Excluding paths and antipaths
    413 -- 434Tao Feng, Koji Momihara, Qing Xiang. Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes
    435 -- 476Jacob Fox, Po-Shen Loh, Yufei Zhao. The critical window for the classical Ramsey-Turán problem
    477 -- 495Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001. The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
    497 -- 512Hal A. Kierstead, Alexandr V. Kostochka. A refinement of a result of Corrádi and Hajnal

    Volume 35, Issue 3

    253 -- 277Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol. On the number of matroids
    279 -- 294Geoffrey R. Grimmett, Zhongyang Li. Bounds on connective constants of regular graphs
    295 -- 308Alex Iosevich, Misha Rudnev, Yujia Zhai. Areas of triangles and Beck's theorem in planes over finite fields
    309 -- 315Richard J. Martin, Michael J. Kearney. Integral representation of certain combinatorial recurrences
    317 -- 387Elchanan Mossel, Miklós Z. Rácz. A quantitative Gibbard-Satterthwaite theorem without neutrality

    Volume 35, Issue 2

    127 -- 151Miklós Abért, Tamás Hubai. Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs
    153 -- 180Nathan Bowler, Johannes Carmesin. Matroid intersection, base packing and base covering for infinite matroids
    181 -- 208Bart De Bruyn, Frédéric Vanhove. On Q-polynomial regular near 2d-gons
    209 -- 214Jim Geelen, Peter Nelson. An analogue of the Erdős-Stone theorem for finite geometries
    215 -- 233Assaf Rinot. Chromatic numbers of graphs - large gaps
    235 -- 252Pablo Soberón. Equal coefficients and tolerance in coloured Tverberg partitions

    Volume 35, Issue 1

    1 -- 38Bartlomiej Bosek, Tomasz Krawczyk. A subexponential upper bound for the on-line chain partitioning problem
    39 -- 61Adrian Dumitrescu, Csaba D. Tóth. Packing anchored rectangles
    63 -- 74Gábor Korchmáros, Gábor P. Nagy, Nicola Pace. k-nets embedded in a projective plane over a field
    75 -- 94Asaf Shapira, Benny Sudakov. Small complete minors above the extremal edge density
    95 -- 126Csaba D. Tóth. The Szemerédi-Trotter theorem in the complex plane
    runs on