1. The edge density of 4-critical planar graphs

   • H. L. Abbott
   • B. Zhou

   OriginalPaper Pages: 185 - 189

2. Cycles in weighted graphs

   • J. A. Bondy
   • Genghua Fan

   OriginalPaper Pages: 191 - 205

3. The number oft-wise balanced designs

   • Charles J. Colbourn
   • Dean G. Hoffman
   • Peter M. Winkler

   OriginalPaper Pages: 207 - 218

4. b-matching degree-sequence polyhedra

   • William H. Cunningham
   • Jan Green-Krótki

   OriginalPaper Pages: 219 - 230

5. On the number of edge disjoint cliques in graphs of given size

   • Ervin Győri

   OriginalPaper Pages: 231 - 243

6. A note on induced cycles in Kneser graphs

   • Y. Kohayakawa

   OriginalPaper Pages: 245 - 251

7. Graham-Rothschild parameter words and measurable partitions

   • Hans Jürgen Prömel
   • Bernd Voigt

   OriginalPaper Pages: 253 - 259

8. Directed circuits on a torus

   • P. D. Seymour

   OriginalPaper Pages: 261 - 273

9. Computing combinatorial decompositions of rings

   • Bernd Sturmfels
   • Neil White

   OriginalPaper Pages: 275 - 293

10. A note on the sharp concentration of the chromatic number of random graphs

    • Tomasz Luczak

    Note Pages: 295 - 297