1. Fractional matchings and covers in infinite hypergraphs

   • Ron Aharoni

   OriginalPaper Pages: 181 - 184

2. On submodular function minimization

   • William H. Cunningham

   OriginalPaper Pages: 185 - 192

3. How many atoms can be defined by boxes?

   • A. Gyárfás
   • J. Lehel
   • ZS. Tuza

   OriginalPaper Pages: 193 - 204

4. Counting points in hypercubes and convolution measure algebras

   • D. Hajela
   • P. Seymour

   OriginalPaper Pages: 205 - 214

5. Inclusion-exclusion inequalities

   • Melvin Hausner

   OriginalPaper Pages: 215 - 225

6. Note to a problem of T. Gallai and G. A. Dirac

   • G. Koester

   OriginalPaper Pages: 227 - 228

7. Maximum set of edges no two covered by a clique

   • A. V. Kostochka

   OriginalPaper Pages: 229 - 235

8. A desarguesian theorem for algebraic combinatorial geometries

   • B. Lindström

   OriginalPaper Pages: 237 - 239

9. On a problem of spencer

   • J. B. Shearer

   OriginalPaper Pages: 241 - 245

10. A strongly polynomial minimum cost circulation algorithm

    • Éva Tardos

    OriginalPaper Pages: 247 - 255

11. A shellable poset that is not lexicographically shellable

    • A. Vince
    • M. Wachs

    OriginalPaper Pages: 257 - 260

12. Independent sets ink-chromatic graphs

    • H. -J. Voss

    OriginalPaper Pages: 261 - 269