Graph Theory and Combinatorics: Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös 1983

In his famous address on mathematical problems, Hilbert remarked that “the clearness and ease of comprehension insisted on for a mathematical theory I should still more demand for a mathematical problem, if it is to be perfect. For what is clear and easily comprehended
attracts; the complicated repels us.” Graph theory is fortunate to have, in the work of Paul Erdos, a rich source of problems which meet Hilbert’s standard. During the past half-century his skills have contributed to number theory, logic, probability and function theory but, above all, they have made him a driving force behind the rapid development of graph
theory and combinatorics. His problems and solutions now fill a list of publications of a length to rival Cayley’s 967. In his many journeys through the world, Paul Erdos has come to know and to help a great army of mathematicians. They owe much to his encouragement and stimulus. Those of us at the conference were pleased to mark our own debt to him at a celebration dinner on 24 March 1983. Professor Richard Guy proposed a moving and memorable toast to Paul Erdos and received a witty and surprisingly cheerful reply.