1. Some non-existence results on divisible difference sets

   • K. T. Arasu
   • James Davis
   • Alexander Pott

   OriginalPaper Pages: 1 - 8

2. The existence of non-trivial hyperfactorizations ofK _2n

   • Endre Boros
   • Dieter Jungnickel
   • Scott A. Vanstone

   OriginalPaper Pages: 9 - 15

3. On modp transversals

   • Jeff Kahn
   • Roy Meshulam

   OriginalPaper Pages: 17 - 22

4. An Ω(n ^5/4) lower bound on the randomized complexity of graph properties

   • Valerie King

   OriginalPaper Pages: 23 - 32

5. Efficient representation of perm groups

   • Donald E. Knuth

   OriginalPaper Pages: 33 - 43

6. The chromatic number of random graphs

   • Tomasz Łuczak

   OriginalPaper Pages: 45 - 54

7. Spanning trees with bounded degrees

   • Victor Neumann-Lara
   • Eduardo Rivera-Campo

   OriginalPaper Pages: 55 - 61

8. Pseudorandom bits for constant depth circuits

   • Noam Nisan

   OriginalPaper Pages: 63 - 70

9. A mixed version of Menger's theorem

   • Yoshimi Egawa
   • Atsushi Kaneko
   • Makoto Matsumoto

   Note Pages: 71 - 74

10. On a Turán type problem of Erdös

    • Zoltán Füredi

    Note Pages: 75 - 79