External Links

    Journal: Combinatorica

    Volume 34, Issue 6

    631 -- 655Abhijin Adiga, L. Sunil Chandran, Naveen Sivadasan. Lower bounds for boxicity
    657 -- 688Éric Balandraud, Benjamin Girard. p
    689 -- 706Mike Bennett, Alex Iosevich, Jonathan Pakianathan. 2 via the Elekes-Sharir Paradigm
    707 -- 742Thilo V. Weinert. Idiosynchromatic Poetry

    Volume 34, Issue 5

    507 -- 526József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy. Partitioning 2-edge-colored graphs by monochromatic paths and cycles
    527 -- 546Simon R. Blackburn, Thomas A. McCourt. Triangulations of the sphere, bitrades and abelian groups
    547 -- 559Stephan Brandt, Janina Müttel, Dieter Rautenbach. The circumference of the square of a connected graph
    561 -- 572John Haslegrave. Judicious partitions of uniform hypergraphs
    573 -- 596Dan Hefetz, Daniela Kühn, John Lapinskas, Deryk Osthus. Optimal covers with Hamilton cycles in random graphs
    597 -- 629András Sebö, Jens Vygen. Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs

    Volume 34, Issue 4

    379 -- 406Elad Aigner-Horev, Hiêp Hàn, Mathias Schacht. Extremal results for odd cycles in sparse pseudorandom graphs
    407 -- 426Xavier Dahan. Regular graphs of large girth and arbitrary degree
    427 -- 470Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros. Measurable events indexed by products of trees
    471 -- 486Nathan Linial, Zur Luria. An upper bound on the number of high-dimensional permutations
    487 -- 505Andrew Suk. Coloring intersection graphs of x-monotone curves in the plane

    Volume 34, Issue 3

    255 -- 277Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev. Steiner transitive-closure spanners of low-dimensional posets
    279 -- 298Matt DeVos, Zdenek Dvorak, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide. A minimum degree condition forcing complete graph immersion
    299 -- 322Zoltán Füredi, Tao Jiang, Robert Seiver. Exact solution of the hypergraph Turán problem for k-uniform linear paths
    323 -- 329Alexandr V. Kostochka, Matthew Yancey. Ore's conjecture for k=4 and Grötzsch's Theorem
    331 -- 358Cédric Lecouvey. Plünnecke and Kneser type theorems for dimension estimates
    359 -- 377Amir Shpilka, Avishay Tal. On the minimal fourier degree of symmetric Boolean functions

    Volume 34, Issue 2

    129 -- 138M. Amin Bahmanian. Connected Baranyai's theorem
    139 -- 172Yair Glasner. Strong approximation in random towers of graphs
    173 -- 206Parikshit Gopalan. Constructing Ramsey graphs from Boolean function representations
    207 -- 252Roi Krakovski. Topological minors in line graphs - A proof of Zha's conjecture
    253 -- 254R. Bruce Richter, Brendan Rooney, Carsten Thomassen. Erratum to: Commentary for "On planarity of compact, locally connected, metric spaces"

    Volume 34, Issue 1

    1 -- 10Aart Blokhuis, Andries E. Brouwer, Çiçek Güven. Cocliques in the Kneser graph on the point-hyperplane flags of a projective space
    11 -- 46Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein. Connectivity and tree structure in finite graphs
    47 -- 60Yoshimi Egawa, Kenta Ozeki. A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
    61 -- 94Edita Mácajová, Martin Skoviera. Sparsely intersecting perfect matchings in cubic graphs
    95 -- 114Zeev Nutov. Approximating minimum-cost edge-covers of crossing biset-families
    115 -- 128Jin-Xin Zhou, Yan-Quan Feng. Edge-transitive dihedral or cyclic covers of cubic symmetric graphs of order 2P
    runs on