Preface; Paul Erdös: the man and the mathematician (1913-96) Miklós
Simonovits and Vera T. Sós; 1. A selection of problems and results in
combinatorics Paul Erdös; 2. Combinatorial Nullstellensatz Noga Alon; 3.
Connectedness, classes and cycle index E. A. Bender, P. J. Cameron, A. M.
Odlyzko and L. B. Richmond; 4. A Tutte polynomial for coloured graphs Béla
Bollobás and Oliver Riordan; 5. Notes on sum-free and related sets Peter J.
Cameron and Paul Erdös; 6. Geometrical bijections in discrete lattices
Hans-Georg Carstens, Walter A. Deuber, Wolfgang Thumser and Elke
Koppenrade; 7. On random intersection graphs: the subgraph problem Michal
Karonski, Edward R. Scheinerman and Karen B. Singer-Cohen; 8. The blow-up
lemma János Komlós; 9. The homomorphism structure of classes of graphs
Jaroslav Nesetril; 10. Problem collection of the DIMANET Mátraháza
workshop, 22-28 October 1995.
