1. Paul Erdös 1913–1996

   • László Babai

   Announcement Pages: 451 - 452

2. Distributed near-optimal matching

   • Xiaotie Deng

   OriginalPaper Pages: 453 - 464

3. Inclusion-exclusion: Exact and approximate

   • Jeff Kahn
   • Nathan Linial
   • Alex Samorodnitsky

   OriginalPaper Pages: 465 - 477

4. On-line coloring of perfect graphs

   • H. A. Kierstead
   • K. Kolossa

   OriginalPaper Pages: 479 - 491

5. Classes of graphs that exclude a tree and a clique and are not vertex ramsey

   • H. A. Kierstead
   • Yingxian Zhu

   OriginalPaper Pages: 493 - 504

6. Edge partitions of the Rado graph

   • Maurice Pouzet
   • Norbert Sauer

   OriginalPaper Pages: 505 - 520

7. Dense graphs and edge reconstruction

   • L. Pyber

   OriginalPaper Pages: 521 - 525

8. Groups with super-exponential subgroup growth

   • L. Pyber
   • A. Shalev

   OriginalPaper Pages: 527 - 533

9. Packing directed circuits

   • Bruce Reed
   • Neil Robertson
   • Robin Thomas

   OriginalPaper Pages: 535 - 554

10. The gallai-younger conjecture for planar graphs

    • B. A. Reed
    • F. B. Shepherd

    OriginalPaper Pages: 555 - 566

11. The probability thatn random points in a triangle are in convex position

    • Pavel Valtr

    OriginalPaper Pages: 567 - 573

12. Worst case asymptotics for some classical optimization problems

    • J. E. Yukich

    OriginalPaper Pages: 575 - 586

13. Representation of elements of a sequence by sumsets

    • Vsevolod F. Lev

    OriginalPaper Pages: 587 - 590

14. On exchange axioms for valuated matroids and valuated delta-matroids

    • Kazuo Murota

    Note Pages: 591 - 596