External Links

    Journal: Combinatorica

    Volume 36, Issue 6

    623 -- 660Shagnik Das, Wenying Gan, Benny Sudakov. The minimum number of disjoint pairs in set systems and related problems
    661 -- 686Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood. Nonrepetitive colouring via entropy compression
    687 -- 702Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger. On the sum necessary to ensure that a degree sequence is potentially H-graphic
    703 -- 723Lauren Keough, Andrew John Radcliffe. Graphs with the fewest matchings
    725 -- 744Klaus Metsch. Small tight sets in finite elliptic, parabolic and Hermitian polar spaces

    Volume 36, Issue 5

    493 -- 512Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov. On the densities of cliques and independent sets in graphs
    513 -- 535Dieter Jungnickel, Klaus Metsch. The characterization problem for designs with the parameters of AGd(n, q)
    537 -- 556Jie Ma, Xingxing Yu. On judicious bipartitions of graphs
    557 -- 589Alexander Stoimenow. A theorem on graph embedding with a relation to hyperbolic volume
    591 -- 600Andreas Thom. The expected degree of minimal spanning forests
    601 -- 621Carsten Thomassen. Orientations of infinite graphs with prescribed edge-connectivity

    Volume 36, Issue 4

    371 -- 393Edward Dobson, Pablo Spiga, Gabriel Verret. Cayley graphs on abelian groups
    395 -- 415Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini. Sabidussi versus Hedetniemi for three variations of the chromatic number
    417 -- 429Andreas F. Holmsen, Edgardo Roldán-Pensado. The colored Hadwiger transversal theorem in ℝ d
    431 -- 450Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang. Tree-width and dimension
    451 -- 469Daniela Kühn, Deryk Osthus, Timothy Townsend. Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
    471 -- 492Allan Lo. Properly coloured Hamiltonian cycles in edge-coloured complete graphs

    Volume 36, Issue 3

    249 -- 264Gregory L. Cherlin, Saharon Shelah. Universal graphs with a forbidden subgraph: Block path solidity
    265 -- 311Justin Gilmer, Michael E. Saks, Srikanth Srinivasan. Composition limits and separating examples for some boolean function complexity measures
    313 -- 332Matthias Hamann. Spanning trees in hyperbolic graphs
    333 -- 347Florian Lehner. Distinguishing graphs with intermediate growth
    349 -- 364Adam Sheffer, Joshua Zahl, Frank de Zeeuw. Few distinct distances implies no heavy lines or circles
    365 -- 369Igor Protasov, Sergiy Slobodianiuk. Note: A conjecture on partitions of groups

    Volume 36, Issue 2

    129 -- 159Ben Green, Robert Morris. Counting sets with small sumset and applications
    161 -- 185Venkatesan Guruswami, Swastik Kopparty. Explicit subspace designs
    187 -- 194Guy Moshkovitz, Asaf Shapira. A short proof of Gowers' lower bound for the regularity lemma
    195 -- 227Ori Parzanchevski, Ron Rosenthal, Ran J. Tessler. Isoperimetric inequalities in simplicial complexes
    229 -- 248Alain Plagne, Anne de Roton. Maximal sets with no solution to x+y=3z

    Volume 36, Issue 1

    1 -- 36Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka. Tight lower bounds for linear 2-query LCCs over finite fields
    37 -- 70David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov. Ramsey numbers of cubes versus cliques
    71 -- 89Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan. On the Ramsey number of the triangle and the cube
    91 -- 120Tali Kaufman, Avi Wigderson. Symmetric LDPC codes and local testing
    121 -- 127Tsai-Lien Wong, Xuding Zhu. Every graph is (2, 3)-choosable
    runs on