1. Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

   • F. Franek
   • V. Rödl

   Original Papers Pages: 299 - 308

2. The Uniformity Lemma for hypergraphs

   • P. Frankl
   • V. Rödl

   Original Papers Pages: 309 - 312

3. A note on the arboricity of graphs

   • Martin Kochol

   Original Papers Pages: 313 - 315

4. CirculantGH(p ²; Z _p ) exist for all primesp

   • Warwick de Launey

   Original Papers Pages: 317 - 321

5. Monochromatic Vs multicolored paths

   • Hanno Lefmann
   • Vojtěch Rödl
   • Robin Thomas

   Original Papers Pages: 323 - 332

6. Packing, covering and decomposing of a complete uniform hypergraph into delta-systems

   • Zbigniew Lonc

   Original Papers Pages: 333 - 341

7. Minimal asymmetric graphs of induced length 4

   • Jaroslav Nešetřil
   • Gert Sabidussi

   Original Papers Pages: 343 - 359

8. Peripheral and eccentric vertices in graphs

   • K. B. Reid
   • Weizhen Gu

   Original Papers Pages: 361 - 375

9. A generalization of Menger's theorem for certain unicyclic graphs

   • E. Sampathkumar

   Original Papers Pages: 377 - 380

10. 2-Designs overGF(q)

    • Hiroshi Suzuki

    Original Papers Pages: 381 - 389

11. Sets of vectors with many orthogonal paris:

    • Zoltán Füredi
    • Richard Stanley

    Research Problems Pages: 391 - 394