Volume 6,
Number 1,
January 1995
- Vojtech Rödl, Robin Thomas:
On the Genus of a Random Graph.
1-12
- Noga Alon, Benny Sudakov:
Disjoint Systems.
13-20
- Hans Jürgen Prömel, Angelika Steger:
Random I-Cororable Graphs.
21-38
- Joseph Naor, Ron M. Roth:
Constructions of Permutation Arrays for Certain Scheduling Cost Measures.
39-50
- Uriel Feige:
A Tight Upper Bound on the Cover Time for Random Walks on Graphs.
51-54
- Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen:
Randomized Greedy Matching II.
55-74
- Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae.
75-88
- E. Rodney Canfield, L. H. Harper:
Large Antichains in the Partition Lattice.
89-104
- John Preater:
A Passage Time for Greedy-Coloring Cycles.
105-112
- Ron Blei, Yuval Peres, James H. Schmerl:
Fractional Products of Sets.
113-120
Volume 6,
Number 2/3,
March-May 1995
- Rainer Kemp:
On the Inner Structure of Multidimensional Simply Generated Trees.
121-146
- V. F. Kolchin:
On Classification in Presence of Measurement Errors.
147-160
- Michael Molloy, Bruce A. Reed:
A Critical Point for Random Graphs with a Given Degree Sequence.
161-180
- Jerzy Tyszkiewicz:
Probabilities in First-Order Logic of a Unary Function and a Binary Relation.
181-192
- David A. Grable:
The Diameter of a Random Graph with Bounded Diameter.
193-200
- Lars Holst:
The General Birthday Problem.
201-208
- Richard A. Duke, Hanno Lefmann, Vojtech Rödl:
On Uncrowded Hypergraphs.
209-212
- Svante Janson:
Hamilton Cycles in a Random Tournament.
213-220
- Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak:
Connectivity Properties of Random Subgraphs of the Cube.
221-230
- Graham Brightwell:
Random Graph Orders Do Not Satisfy a 0-1 Law.
231-238
- James F. Lynch:
On the Threshold of Chaos in Random Boolean Cellular Automata.
239-260
- Noga Alon, Zsolt Tuza:
The Acyclic Orientation Game on Random Graphs.
261-268
- Alexandr V. Kostochka:
The Number of Spanning Trees in Graphs with Given Degree Sequence.
269-274
- Andrew M. Odlyzko:
Search for the Maximum of a Random Walk.
275-296
- Wojciech Kordecki:
Maximal Full Subspaces in Random Projective Spaces- Thresholds and Poisson Approximation.
297-308
- Paul Erdös, Stephen Suen, Peter Winkler:
On the Size of a Random Maximal Graph.
309-318
- Paul Erdös, Vojtech Rödl:
Covering of r-Graphs by Complete r-Partite Subgraphs.
319-322
- Zsolt Tuza:
How to Make A Random Graph Irregular.
323-330
- Robert S. Maier:
The Shape of Stretched Planar Trees.
331-340
- Svante Janson:
A Graph Fourier Transform and Proportional Graphs.
341-352
- Béla Bollobás, Andrew Thomason:
Generalized Chromatic Numbers of Random Graphs.
353-356
- Michael Drmota:
Correlations on the Strata of a Random Mapping.
357-366
Volume 6,
Number 4,
July 1995
Copyright © Tue Dec 1 16:36:05 2009
by Michael Ley (ley@uni-trier.de)
