External Links

    Journal: Combinatorica

    Volume 31, Issue 6

    639 -- 668Jørgen Bang-Jensen, Matthias Kriesell. On the problem of finding disjoint cycles and dicycles in a digraph
    669 -- 689Jonathan Browder, Isabella Novik. Face numbers of generalized balanced Cohen-Macaulay complexes
    691 -- 696Yong-Gao Chen, Jin-Hui Fang. On a problem of Cilleruelo and Nathanson
    697 -- 701Jin-Hui Fang. A characterization of the identity function with equation f(p+q+r)=f(p)+f(q)+f(r)
    703 -- 723Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer. A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
    725 -- 737Hiroshi Nozaki. Inside S-inner product sets and Euclidean designs
    739 -- 754Tamás Terpai. Proof of a conjecture of V. Nikiforov

    Volume 31, Issue 5

    507 -- 528Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin. On the non-existence of pair covering designs with at least as many points as blocks
    529 -- 563Svante Janson. Poset limits and exchangeable random posets
    565 -- 581Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald. On the threshold for k-regular subgraphs of random graphs
    583 -- 614Alexander A. Sherstov. The unbounded-error communication complexity of symmetric functions
    615 -- 629Joseph A. Thas, Hendrik Van Maldeghem. Generalized Veronesean embeddings of projective spaces

    Volume 31, Issue 4

    379 -- 396Shahar Dobzinski, Noam Nisan. Limitations of VCG-based mechanisms
    397 -- 421Bertrand Guenin, Robin Thomas. Packing directed circuits exactly
    423 -- 488Colin McDiarmid, Tobias Müller. On the chromatic number of random geometric graphs
    489 -- 506Ákos Seress, Tsai-Lien Wong, Xuding Zhu. Distinguishing labeling of the actions of almost simple groups

    Volume 31, Issue 3

    257 -- 283Daniela Amato, John K. Truss. Some constructions of highly arc-transitive digraphs
    285 -- 303Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans. Binary subtrees with few labeled paths
    305 -- 320Zeev Dvir, Amir Shpilka. Towards dimension expanders over finite fields
    321 -- 332Alexander Engström. A local criterion for Tverberg graphs
    333 -- 364Zohar Shay Karnin, Amir Shpilka. Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
    365 -- 376R. Bruce Richter, Brendan Rooney, Carsten Thomassen. On planarity of compact, locally connected, metric spaces
    377 -- 378Simeon Ball, Oriol Serra. Erratum to: Punctured Combinatorial Nullstellensätze

    Volume 31, Issue 2

    131 -- 150József Balogh, Wojciech Samotij. The number of ::::K::::::::::m, m::::::-free graphs
    151 -- 164Anders Björner. A ::::q::::-analogue of the FKG inequality and some applications
    165 -- 182Domingos Dellamonica Jr., Vojtech Rödl. Hereditary quasirandom properties of hypergraphs
    183 -- 200Pierre Gillibert, Friedrich Wehrung. An infinite combinatorial statement with a poset parameter
    201 -- 223Erika R. Kovács, László A. Végh. The constructive characterization of (::::κ, ℓ::::)-edge-connected digraphs
    225 -- 244Saharon Shelah, Jindrich Zapletal. Ramsey theorems for product of finite sets with submeasures
    245 -- 256Amir Yehudayoff. Affine extractors over prime fields

    Volume 31, Issue 1

    1 -- 19Richard P. Anstee, Balin Fleming. Linear algebra methods for forbidden configurations
    21 -- 38Eli Berger, Henning Bruhn. Eulerian edge sets in locally finite graphs
    39 -- 53Andrzej Dudek, Vojtech Rödl. On ::::K::::::::::s::::::-free subgraphs in ::::K::::::::::s::::+::::k::::::-free graphs and vertex Folkman numbers
    55 -- 66Molly Dunkum, Peter Hamburger, Attila Pór. Destroying cycles in digraphs
    67 -- 83Hongze Li, Hao Pan. Monochromatic integers adding to polynomials of prime variables
    85 -- 93Edward Marchant, Andrew Thomason. The structure of hereditary properties and 2-coloured multigraphs
    95 -- 126Paul Wollan. Packing cycles with modularity constraints
    127 -- 130David Brink. Chevalley's theorem with restricted variables
    runs on