1. and , Erdős on Graphs, AK Peters Ltd., Wellesley, MA, 1998.
2. Problems and results on finite and infinite combinatorial analysis, Infinite and finite sets (Colloq. Keszthely 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, Colloq Math Soc J Bolyai, Vol. 10, North-Holland, Amsterdam, 1975, 403-424.
3. On the combinatorial problems which I would most like to see solved
4. Problems and results on chromatic numbers in finite and infinite graphs, Graph Theory with Applications to Algorithms and Computer Science (Kalamazoo, MI, 1984), Wiley-Interscience Publ, Wiley, New York, 1985, pp. 201-213,
5. Some of my favourite unsolved problems, A tribute to Paul Erdős, Cambridge University Press, Cambridge, 1990, pp. 467-478.