Random Structures and Algorithms, Volume 12

Volume 12, Number 1, January 1998

Béla Bollobás, Oliver Riordan: Colorings generated by monotone properties. 1-25
Olle Häggström: Uniform and minimal essential spanning forests on trees. 27-50
George S. Lueker: Exponentially small bounds on the expected optimum of the partition and subset sum problems. 51-62
Mathew D. Penrose: Random minimal spanning tree and percolation on the N-cube. 63-82
Shao C. Fang, Santosh S. Venkatesh: The capacity of majority rule. 83-109

Jonathan Aronson, Alan M. Frieze, Boris Pittel: Maximum matchings in sparse random graphs: Karp-Sipser revisited. 111-177
David Aldous: Emergence of the giant component in special Marcus-Lushnikov processes. 179-196
Amram Meir, John W. Moon: On the log-product of the subtree-sizes of random trees. 197-212

Russ Bubley, Martin E. Dyer, Mark Jerrum: An elementary analysis of a procedure for sampling points in a convex body. 213-235
Raphael Yuster: Tree decomposition of graphs. 237-251
Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou: Approximating the unsatisfiability threshold of random formulas. 253-269
Luc Devroye, Amar Goudjil: A study of random Weyl trees. 271-295
János Komlós, Gábor N. Sárközy, Endre Szemerédi: An algorithmic version of the blow-up lemma. 297-312

Yuval Rabani, Yuri Rabinovich, Alistair Sinclair: A computational view of population genetics. 313-334
Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich: The action of a few permutations on r-tuples is quickly transitive. 335-350
Wojciech Banaszczyk: Balancing vectors and Gaussian measures of n-dimensional convex bodies. 351-360
Nicholas Pippenger: Random interval graphs. 361-380
Michael Krivelevich, Benny Sudakov: The chromatic numbers of random hypergraphs. 381-403
Amram Meir, John W. Moon: Addendum to On the log-product of the subtree-sizes of random trees. 405