1. Covering graphs by the minimum number of equivalence relations

   • Noga Alon

   OriginalPaper Pages: 201 - 206

2. Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory

   • Noga Alon

   OriginalPaper Pages: 207 - 219

3. Packing and covering a tree by subtrees

   • I. Bárány
   • L. A. Wolsey
   • J. Edmonds

   OriginalPaper Pages: 221 - 233

4. A non-analytic proof of the newman—znám result for disjoint covering systems

   • M. A. Berger
   • A. Felzenbaum
   • A. S. Fraenkel

   OriginalPaper Pages: 235 - 243

5. A characterization of the minimalbasis of the torus

   • R. Bodendiek
   • K. Wagner

   OriginalPaper Pages: 245 - 260

6. On the sharpness of a theorem of B. segre

   • Endre Boros
   • Tamás Szőnyi

   OriginalPaper Pages: 261 - 268

7. Contractible edges in triangle-free graphs

   • Yoshimi Egawa
   • Hikoe Enomoto
   • Akira Saito

   OriginalPaper Pages: 269 - 274

8. On the non-existence of barker sequences

   • Michele Elia

   OriginalPaper Pages: 275 - 278

9. Orthogonal vectors in then-dimensional cube and codes with missing distances

   • P. Frankl

   OriginalPaper Pages: 279 - 285