External Links

    Journal: Combinatorica

    Volume 37, Issue 6

    1039 -- 1055Victor Chepoi. Distance-Preserving Subgraphs of Johnson Graphs
    1057 -- 1072Maria Chudnovsky, Alex Scott, Paul D. Seymour. Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes
    1073 -- 1095Antonio Cossidente, Francesco Pavese. Subspace Codes in PG(2N - 1, Q)
    1097 -- 1112Genghua Fan. Integer 4-Flows and Cycle Covers
    1113 -- 1124Ervin Györi, Balázs Keszegh. On the Number of Edge-Disjoint Triangles in K 4-Free Graphs
    1125 -- 1137Hongbi Jiang, Daqing Yang. Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True
    1139 -- 1179Tomasz Krawczyk, Bartosz Walczak. On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations
    1181 -- 1205Andrey B. Kupavskii, Alexandr Polyanskii. Proof of Schur's Conjecture in ℝ D
    1207 -- 1219Torsten Mütze, Pascal Su. Bipartite Kneser Graphs are Hamiltonian
    1221 -- 1240Orit E. Raz, Micha Sharir. The Number of Unit-Area Triangles in the Plane: Theme and Variation

    Volume 37, Issue 5

    795 -- 804Aart Blokhuis, Andries E. Brouwer. Cocliques in the Kneser graph on line-plane flags in PG(4;q)
    805 -- 836Eda Cesaratto, Guillermo Matera, Mariana Pérez. The distribution of factorization patterns on linear families of polynomials over a finite field
    837 -- 861Daniel W. Cranston, Landon Rabern. The fractional chromatic number of the plane
    863 -- 886Zdenek Dvorák, Luke Postle. Density of 5/2-critical graphs
    887 -- 910Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko. The Voronoi functional is maximized by the Delaunay triangulation in the plane
    911 -- 951Jacob Fox, László Miklós Lovász. A tight lower bound for Szemerédi's regularity lemma
    953 -- 964Konstantin M. Golubev. On the chromatic number of a simplicial complex
    965 -- 990Mark Jerrum, Kitty Meeks. The parameterised complexity of counting even and odd induced subgraphs
    991 -- 1010Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon. The multiplication table problem for bipartite graphs
    1011 -- 1026James H. Schmerl. Chromatic numbers of algebraic hypergraphs
    1027 -- 1037Carsten Thomassen. Nash-Williams' cycle-decomposition theorem

    Volume 37, Issue 4

    555 -- 572Ron Aharoni, Tomás Kaiser, Shira Zerbib. Fractional covers and matchings in families of weighted d-intervals
    573 -- 616Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person. Powers of Hamilton cycles in pseudorandom graphs
    617 -- 632József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh. The typical structure of graphs with no large cliques
    633 -- 650Alexander I. Barvinok, Pablo Soberón. Computing the partition function for graph homomorphisms
    651 -- 672Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos. Regular families of forests, antichains and duality pairs of relational structures
    673 -- 696Daniel Horsley. Generalising Fisher's inequality to coverings and packings
    697 -- 732Michael Krivelevich, Choongbum Lee, Benny Sudakov. Compatible Hamilton cycles in Dirac graphs
    733 -- 765Anton Malyshev, Igor Pak. Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
    767 -- 784Vojtech Rödl, Andrzej Rucinski 0001, Mathias Schacht. An exponential-type upper bound for Folkman numbers
    785 -- 793Carsten Thomassen. Infinitely connected subgraphs in graphs of uncountable chromatic number

    Volume 37, Issue 3

    313 -- 332Iskander Aliev, Robert Bassett, Jesús A. De Loera, Quentin Louveaux. A quantitative Doignon-Bell-Scarf theorem
    333 -- 374Itai Benjamini, Hilary Finucane, Romain Tessera. On the scaling limit of finite vertex transitive graphs with large diameter
    375 -- 395Mauro Biliotti, Alessandro Montinaro. On the rigidity of the Figueroa replacement in PG(2, q 3)
    397 -- 417Pete L. Clark, Aden Forrow, John R. Schmitt. Warning's Second Theorem with restricted variables
    419 -- 464Gil Cohen, Amir Shpilka, Avishay Tal. On the degree of univariate polynomials over the integers
    465 -- 479Natalia Iyudu, Stanislav Shkarin. Asymptotically optimal k-step nilpotency of quadratic algebras and the Fibonacci numbers
    481 -- 494Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte. Cycles in triangle-free graphs of large chromatic number
    495 -- 519Lothar Narins, Alexey Pokrovskiy, Tibor Szabó. Graphs without proper subgraphs of minimum degree 3 and short cycles
    521 -- 537Eszter Rozgonyi, Csaba Sándor. An extension of Nathanson's Theorem on representation functions
    539 -- 553Terence Tao, Van Vu. Random matrices have simple spectrum

    Volume 37, Issue 2

    129 -- 136Karim A. Adiprasito, Arnau Padrol. The universality theorem for neighborly polytopes
    137 -- 142Levent Alpoge. Square-root cancellation for the signs of Latin squares
    143 -- 155Diana Ojeda-Aristizabal. Finite forms of Gowers' theorem on the oscillation stability of C 0
    157 -- 166Eli Berger. Unfriendly partitions for graphs not containing a subdivision of an infinite clique
    167 -- 182Tai Do Duc, Bernhard Schmidt. Unique differences in symmetric subsets of F P
    183 -- 222Matthias Hamann. The classification of finite and locally finite connected-homogeneous digraphs
    223 -- 251Michael A. Henning, Sandi Klavzar, Douglas F. Rall. The 4/5 upper bound on the game total domination number
    253 -- 268Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. The complexity of proving that a graph is Ramsey
    269 -- 282David Perkinson, Qiaoyu Yang, Kuai Yu. G-parking functions and tree inversions
    283 -- 311Joseph A. Thas, Hendrik Van Maldeghem. Finite affine planes in projective spaces

    Volume 37, Issue 1

    1 -- 30Karim A. Adiprasito, Bruno Benedetti. Subdivisions, shellability, and collapsibility of products
    31 -- 40Jeff Cooper, Dhruv Mubayi. Sparse hypergraphs with low independence number
    41 -- 47Jim Geelen, Peter Nelson. Odd circuits in dense binary matroids
    49 -- 76Jan Hladký, Daniel Král', Sergey Norin. Counting flags in triangle-free digraphs
    77 -- 86Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager. The (2k-1)-connected multigraphs with at most k-1 disjoint cycles
    87 -- 97Kaushik Majumder. On the maximum number of points in a maximal intersecting family of finite sets
    99 -- 125Rom Pinchasi. On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane
    runs on