• Publications
  • Influence
PROBLEMS AND RESULTS IN GRAPH THEORY AND COMBINATORIAL ANALYSIS
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 willExpand
  • 108
  • 28
  • PDF
On the strength of connectedness of a random graph
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 edgesExpand
  • 477
  • 26
Problems and Results in Combinatorial Analysis
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 theExpand
  • 103
  • 26
  • PDF
The size Ramsey number
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 questionsExpand
  • 174
  • 21
  • PDF
Asymmetric graphs
  • 80
  • 19
...
1
2
3
4
5
...