In this short paper I mainly discuss the fate of some of the older problems and state only a few new ones . At a recent meeting in Aberdeen, Scotland, I have a paper of the same title to which I will… Expand

If G is an arbitrary non-complete graph, let cZ1(G) denote the least number k such that by deleting k appropriately chosen vertices from G (i. e. deleting the k points in question and all edges… Expand

I gave many lectures by this and similar titles, many in fact in these conferences and I hope in my lecture in 1978 I will give a survey of the old problems and describe what happened to them. In the… Expand

Let denote the class of all graphsG which satisfyG→(G1,G2). As a way of measuring minimality for members of, we define thesize Ramsey number ř(G1,G2) by.We then investigate various questions… Expand