1. Decomposing k-ARc-Strong Tournaments Into Strong Spanning Subdigraphs

   • Jørgen Bang-Jensen
   • Anders Yeo

   Original Paper Pages: 331 - 349

2. Lower Bounds For Multidimensional Zero Sums

   • Christian Elsholtz

   Original Paper Pages: 351 - 358

3. Isoperimetric Invariants For Product Markov Chains and Graph Products

   • C. Houdré*
   • P. Tetali†

   Original Paper Pages: 359 - 388

4. On Graphs With Small Ramsey Numbers, II

   • A. V. Kostochka*
   • V. Rödl†

   Original Paper Pages: 389 - 401

5. Triangle Factors In Sparse Pseudo-Random Graphs

   • Michael Krivelevich*
   • Benni Sudakov†
   • Tibor Szabó‡

   Original Paper Pages: 403 - 426

6. Matching Polynomials And Duality

   • Bodo Lass

   Original Paper Pages: 427 - 440

7. High Connectivity Keeping Sets In n-Connected Graphs

   • W. Mader

   Original Paper Pages: 441 - 458

8. Blocking Subspaces By Lines In PG(n, q)

   • Klaus Metsch

   Original Paper Pages: 459 - 486

9. Transitivity And Connectivity Of Permutations

   • Patrice Ossona de Mendez
   • Pierre Rosenstiehl

   Original Paper Pages: 487 - 501

10. Regular Resolution Lower Bounds For The Weak Pigeonhole Principle

    • Toniann Pitassi*
    • Ran Raz†

    Original Paper Pages: 503 - 524

11. A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks

    • Michael Saks*
    • Alex Samorodnitsky†
    • Leonid Zosin†

    Original Paper Pages: 525 - 530

12. The Maximum Size Of Graphs With A Uniquek- Factor

    • Lutz Volkmann

    Original Paper Pages: 531 - 540