Volume 8,
Number 1,
January 1996
Volume 8,
Number 2,
March 1996
- Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs.
97-104
- Peter de Jong:
A central limit theorem with applications to random hypergraphs.
105-120
- Colin McDiarmid:
A random bit-flipping method for seeking agreement.
121-130
- Andrés D. Fundia:
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs.
131-147
- Jeff Kahn:
A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
149-157
- Michael Molloy:
A gap between the appearances of a k-core and a (k+1)-chromatic graph.
159-160
Volume 8,
Number 3,
May 1996
Volume 8,
Number 4,
July 1996
Copyright © Tue Dec 1 16:36:05 2009
by Michael Ley (ley@uni-trier.de)