External Links

    Journal: Combinatorica

    Volume 32, Issue 6

    619 -- 628Jacob Fox, Po-Shen Loh. On a problem of Erdös and Rothschild on edges in triangles
    629 -- 649Nick Gravin, Sinai Robins, Dmitry Shiryaev. Translational tilings by a polytope, with multiplicity
    649 -- 688Matthias Hamann, Julian Pott. Transitivity conditions in infinite graphs
    689 -- 702Roman N. Karasev. Analogues of the central point theorem for families with d-intersection property in ℝ d
    703 -- 720Tamás Király, Lap Chi Lau, Mohit Singh. Degree bounded matroids and submodular flows
    721 -- 733Giorgis Petridis. New proofs of Plünnecke-type estimates for product sets in groups
    735 -- 740Hajime Tanaka. The Erdös-Ko-Rado theorem for twisted Grassmann graphs

    Volume 32, Issue 5

    497 -- 511Javier Cilleruelo. Combinatorial problems in finite fields and Sidon sets
    513 -- 535David Conlon, Jacob Fox, Benny Sudakov. On two problems in graph Ramsey theory
    537 -- 571György Elekes, Endre Szabó. How to find groups? (and how to use them in Erdős geometry?)
    573 -- 587Heidi Gebauer. Disproof of the neighborhood conjecture with implications to SAT
    589 -- 605Géza Kós, Lajos Rónyai. Alon's Nullstellensatz for multisets
    607 -- 618Shachar Lovett. Equivalence of polynomial conjectures in additive combinatorics

    Volume 32, Issue 4

    373 -- 401Attila Bernáth, Tamás Király. A unifying approach to splitting-off
    403 -- 424Maria Chudnovsky, Paul D. Seymour. Perfect matchings in planar cubic graphs
    425 -- 449Péter Csikvári, Katalin Gyarmati, András Sárközy. Density and ramsey type results on algebraic equations with restricted solution sets
    451 -- 471John Haslegrave. The Bollobás-Thomason conjecture for 3-uniform hypergraphs
    473 -- 482János Pach, Gábor Tardos, József Solymosi. Remarks on a Ramsey theory for trees
    483 -- 495Florian Pfender. Complete subgraphs in multipartite graphs

    Volume 32, Issue 3

    251 -- 282Maria Chudnovsky, Paul D. Seymour. Packing seagulls
    283 -- 287Maria Chudnovsky, Sang-il Oum, Paul D. Seymour. Finding minimum clique capacity
    289 -- 308Fedor V. Fomin, Yngve Villanger. Treewidth computation and extremal combinatorics
    309 -- 323Jan-Christoph Schlage-Puchta. Applications of character estimates to statistical problems for the symmetric group
    325 -- 362Saharon Shelah. Universality among graphs omitting a complete bipartite graph
    363 -- 372Terence Tao, Van H. Vu. The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi

    Volume 32, Issue 2

    125 -- 141Paul Balister, Béla Bollobás. Projections, entropy and sumsets
    143 -- 169József Balogh, Dhruv Mubayi. Almost all triangle-free triple systems are tripartite
    171 -- 186David Conlon. On the Ramsey multiplicity of complete graphs
    187 -- 203Ervin Györi, Nathan Lemons. 3-uniform hypergraphs avoiding a given odd cycle
    205 -- 219Hao Huang, Benny Sudakov. A counterexample to the Alon-Saks-Seymour conjecture and related problems
    221 -- 250Marcus Isaksson, Guy Kindler, Elchanan Mossel. The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem

    Volume 32, Issue 1

    1 -- 33Omer Angel, Abraham D. Flaxman, David B. Wilson. A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
    35 -- 53Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah. Monotonicity testing and shortest-path routing on the cube
    55 -- 84Dustin Cartwright, Melody Chan. Three notions of tropical rank for symmetric matrices
    85 -- 110Eryk Kopczynski, Igor Pak, Piotr Przytycki. Acute triangulations of polyhedra and ℝ N
    111 -- 123A. M. Raigorodskii. On the chromatic numbers of spheres in ℝ n
    runs on