External Links

    Journal: Random Struct. Algorithms

    Volume 35, Issue 4

    393 -- 417Tom Bohman, Alan M. Frieze. Hamilton cycles in 3-out
    418 -- 430Gruia Calinescu, Chandra Chekuri, Jan Vondrák. Disjoint bases in a polymatroid
    431 -- 443Heidi Gebauer, Tibor Szabó. Asymptotic random graph intuition for the biased connectivity game
    444 -- 463Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus. Minors in random regular graphs
    464 -- 522Éric Fusy. Uniform random sampling of planar graphs in linear time

    Volume 35, Issue 3

    271 -- 293Tomasz Luczak, Taral Guldahl Seierstad. The critical behavior of random digraphs
    294 -- 322Béla Bollobás, Oliver Riordan. Clique percolation
    323 -- 347Louigi Addario-Berry, Nicolas Broutin, B. Reed. Critical random graphs and the structure of a minimum spanning tree
    348 -- 368Alexandr V. Kostochka, Mohit Kumbhat. Coloring uniform hypergraphs with few edges
    369 -- 389József Balogh, Ryan Martin, András Pluhár. The diameter game
    390 -- 392Steven Finch, Pascal Sebah. Comment on Volumes spanned by random points in the hypercube

    Volume 35, Issue 2

    137 -- 162Gergely Ambrus, Imre Bárány. Longest convex chains
    163 -- 193Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman. Testing low-degree polynomials over prime fields
    194 -- 215Fabrice Guillemin, Philippe Robert. Analysis of Steiner subtrees of random trees for traceroute algorithms
    216 -- 221András Pluhár. Greedy colorings of uniform hypergraphs
    222 -- 249Catherine S. Greenhill, Brendan D. McKay. Random dense bipartite graphs and directed graphs with specified degrees
    250 -- 270Elchanan Mossel, Allan Sly. Rapid mixing of Gibbs sampling on graphs that are sparse on average

    Volume 35, Issue 1

    1 -- 14David Conlon, Jacob Fox, Benny Sudakov. Ramsey numbers of sparse hypergraphs
    15 -- 41Kasper Pedersen. On systematic scan for sampling H-colorings of the path
    42 -- 69Cyril Banderier, Markus Kuba, Alois Panholzer. Analysis of three graph parameters for random trees
    83 -- 99Michael Krivelevich, Balázs Patkós. Equitable coloring of random graphs
    100 -- 117Alexander Gamburd, Shlomo Hoory, Mehrdad Shahshahani, Aner Shalev, B. Virág. On the girth of random Cayley graphs
    118 -- 136Peter Hegarty, Steven J. Miller. When almost all sets are difference dominated
    runs on