1. On Turán’s theorem for sparse graphs

   • M. Ajtai
   • P. Erdős
   • E. Szemerédi

   OriginalPaper Pages: 313 - 317

2. Roth’s estimate of the discrepancy of integer sequences is nearly sharp

   • József Beck

   OriginalPaper Pages: 319 - 325

3. Balanced two-colorings of finite sets in the square I

   • József Beck

   OriginalPaper Pages: 327 - 335

4. Longest paths in digraphs

   • J. C. Bermond
   • A. Germa
   • D. Sotteau

   OriginalPaper Pages: 337 - 341

5. Normal subgroups of infinite multiply transitive permutation groups

   • P. J. Cameron

   OriginalPaper Pages: 343 - 347

6. Bin packing can be solved within 1 + ε in linear time

   • W. Fernandez de la Vega
   • G. S. Lueker

   OriginalPaper Pages: 349 - 355

7. Intersection theorems with geometric consequences

   • P. Frankl
   • R. M. Wilson

   OriginalPaper Pages: 357 - 368

8. Matching behaviour is asymptotically normal

   • C. D. Godsil

   OriginalPaper Pages: 369 - 376

9. Ann-dimensional search problem with restricted questions

   • Ervin Győri

   OriginalPaper Pages: 377 - 380

10. Intersections ofk-element sets

    • D. J. Kleitman
    • J. Shearer
    • D. Sturtevant

    OriginalPaper Pages: 381 - 384

11. On a property ofn-edge-connected digraphs

    • W. Mader

    OriginalPaper Pages: 385 - 386

12. On minors of non-binary matroids

    • P. D. Seymour

    OriginalPaper Pages: 387 - 394