Random Structures and Algorithms, Volume 3

Volume 3, Number 1, Spring 1992

Noga Alon: The String Chromatic Number of a Graph. 1-8 BibTeX
William M. Y. Goh, Eric Schmutz: Gap-Free Set Partitions. 9-18 BibTeX
James F. Lynch: Probabilities of Sentences about Very Sparse Random Graphs. 33-54 BibTeX
Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak: The Evaluation of Random Subgraphs of the Cube. 55-90 BibTeX
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid: Volumes Spanned by Random Points in the Hypercube. 91-106 BibTeX
Wenceslas Fernandez de la Vega, L. Marquez Gordones: The Forwarding Indeces of Random Graphs. 107-116 BibTeX

Robert W. Robinson, Nicholas C. Wormald: Almost All Cubic Graphs Are Hamiltonian. 117-126 BibTeX
Svante Janson, Joel Spencer: Probabilistic Construction of Proportional Graphs. 127-138 BibTeX
Christian Mazza: Parallel Simulated Annealing. 139-148 BibTeX
Sergei A. Zuyev: Estimates for Distributions of the Voronoi Polygon's Geometric Characteristics. 149-162 BibTeX
Oded Goldreich, Hugo Krawczyk: Sparse Pseudorandom Distributions. 163-174 BibTeX
Vojtech Rödl, Zsolt Tuza: Rainbow Subgraphs in Properly Edge-colored Graphs. 175-182 BibTeX
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay: Asymptotic Properties of Labeled Connected Graphs. 183-202 BibTeX
Luc Devroye: A Note on the Probabilistic Analysis of Patricia Trees. 203-214 BibTeX
Neil J. Calkin, Alan M. Frieze, Ludek Kucera: On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph. 215-222 BibTeX
James B. Shearer: A Note on Bipartite Subgraphs of Triangle-Free Graphs. 223-226 BibTeX

Wansoo T. Rhee: On the Travelling Salesperson Problem in Many Dimensions. 227-234 BibTeX
Alan M. Frieze, Stephen Suen: Counting the Number of Hamilton Cycles in Random Digraphs. 235-242 BibTeX
Charles M. Newman: Chain Lengths in Certain Random Directed Graphs. 243-254 BibTeX
Hosam M. Mahmoud, Robert T. Smythe: Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. 255-266 BibTeX
Andrew D. Barbour: Refined Approximation for the Ewens Sampling Forumla. 267-276 BibTeX
Colin Cooper: 1-Pancyclic Hamilton Cycles in Random Graphs. 277-288 BibTeX
Noga Alon, Oded Goldreich, Johan Håstad, René Peralta: Simple Construction of Almost k-wise Independent Random Variables. 289-304 BibTeX
Philippe Flajolet, L. Bruce Richmond: Generalized Digital Trees and Their Difference-Differential Equations. 305-320 BibTeX
Richard Arratia, Simon Tavaré: Limit Theorems for Combinatorial Structures via Discrete Process Approximations. 321-346 BibTeX

Mark Jerrum: Large Cliques Elude the Metropolis Process. 347-360 BibTeX
Walter J. Gutjahr: The Variance of Level Numbers in Certain Families of Trees. 361-374 BibTeX
Hans Jürgen Prömel, Angelika Steger: Coloring Clique-free Graphs in Linear Expected Time. 375-402 BibTeX
Ljuben R. Mutafchiev: Local Limit Theorems for Sums of Power Series Distributed Random Variables and for the Number of Components in Labelled Relational Structures. 403-426 BibTeX
Nancy Eaton, Vojtech Rödl: A Canonical Ramsey Theorem. 427-444 BibTeX
Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald: Enumeration of Almost-Convex Polygons on the Square Lattice. 445-462 BibTeX