1. Large faces in 4-critical planar graphs with minimum degree 4

   • H. L. Abbott
   • D. R. Hare
   • B. Zhou

   OriginalPaper Pages: 455 - 467

2. Some remarks on (k−1)-critical subgraphs ofk-critical graphs

   • H. L. Abbott
   • B. Zhou

   OriginalPaper Pages: 469 - 474

3. A splitting property of maximal antichains

   • Rudolf Ahlswede
   • Péter L. Erdős
   • Niall Graham

   OriginalPaper Pages: 475 - 480

4. Local structure of graphs with λ=μ=2,a ₂=4

   • K. Coolsaet

   OriginalPaper Pages: 481 - 487

5. Covering the edges of a random graph by cliques

   • Alan Frieze
   • Bruce Reed

   OriginalPaper Pages: 489 - 497

6. Minimizing submodular functions over families of sets

   • M. X. Goemans
   • V. S. Ramakrishnan

   OriginalPaper Pages: 499 - 513

7. Principal structure of submodular systems and hitchcock-type independent flows

   • Satoru Iwata

   OriginalPaper Pages: 515 - 532

8. Exixtence of vertices of local connectivityk in digraphs of large outdegree

   • W. Mader

   OriginalPaper Pages: 533 - 539

9. Uniqueness and minimality of large face-width embeddings of graphs

   • Bojan Mohar

   OriginalPaper Pages: 541 - 556

10. On rank vs. communication complexity

    • Noam Nisan
    • Avi Wigderson

    OriginalPaper Pages: 557 - 565

11. On the “log rank”-conjecture in communication complexity

    • Ran Raz
    • Boris Spieker

    OriginalPaper Pages: 567 - 588

12. Ramsey families which exclude a graph

    • V. Rödl
    • N. Sauer
    • X. Zhu

    OriginalPaper Pages: 589 - 596