External Links

    Journal: Random Struct. Algorithms

    Volume 40, Issue 4

    399 -- 424Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali. Entropy and set cardinality inequalities for partition-determined functions
    425 -- 436Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci. Properly coloured copies and rainbow copies of large graphs with small maximum degree
    437 -- 451Sourav Chatterjee. The missing log in large deviations for triangle counts
    452 -- 459Bobby DeMarco, Jeff Kahn. Upper tails for triangles
    460 -- 492Lincoln Chayes, S. Alex Smith. Large deviation analysis for layered percolation problems on the complete graph
    493 -- 500Andrzej Dudek, Reshma Ramadurai, Vojtech Rödl. On induced Folkman numbers
    501 -- 533Markus Jalsenius. Sampling colourings of the triangular lattice

    Volume 40, Issue 3

    269 -- 300Alan M. Frieze, Michael Krivelevich, Po-Shen Loh. Packing tight Hamilton cycles in 3-uniform hypergraphs
    301 -- 316Wojciech Banaszczyk. On series of signed vectors and their rearrangements
    317 -- 349Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic
    350 -- 384Ilan Gronau, Shlomo Moran, Sagi Snir. Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
    385 -- 397Paul Horn, Mary Radcliffe. Giant components in Kronecker graphs

    Volume 40, Issue 2

    133 -- 149Fiachra Knox, Daniela Kühn, Deryk Osthus. Approximate Hamilton decompositions of random graphs
    150 -- 181Elisabetta Candellero, Lorenz A. Gilch. Phase transitions for random walk asymptotics on free products of groups
    182 -- 219André Galligo, Laurent Miclo. On the cut-off phenomenon for the transitivity of randomly generated subgroups
    220 -- 226Jacob van den Berg, Bernardo N. B. de Lima, Pierre Nolin. A percolation process on the square lattice where large finite clusters are frozen
    227 -- 253Dmitry A. Shabanov. Random coloring method in the combinatorial problem of Erdős and Lovász
    254 -- 267Guy Wolfovitz. A concentration result with application to subgraph count

    Volume 40, Issue 1

    1 -- 38David Conlon, Hiêp Hàn, Yury Person, Mathias Schacht. Weak quasi-randomness for uniform hypergraphs
    39 -- 48Fan Chung Graham. Quasi-random hypergraphs revisited
    49 -- 73Domingos Dellamonica Jr.. The size-Ramsey number of trees
    74 -- 104Ariel Gabizon, Ronen Shaltiel. Increasing the output length of zero-error dispersers
    105 -- 131Asaf Shapira, Raphael Yuster. The quasi-randomness of hypergraph cut properties
    runs on