SOME RECENT RESULTS ON EXTREMAL PROBLEMS IN GRAPH THEORY (Results)

@inproceedings{ERDdS2002SOMERR,
  title={SOME RECENT RESULTS ON EXTREMAL PROBLEMS IN GRAPH THEORY (Results)},
  author={P. ERDdS and Paul Erdős},
  year={2002}
}
Three years ago I gave a talk on extremal problems in graph theory at Smolenice [2]. I will refer to this paper as I. I will only discuss results which have been found since the publication of I. ~(9) will denote the number of vertices, V(g) the number of edges of 9. s(a ; I) will denote a graph of n vertices and I edges. The vertices of 3 will be denoted by letters x, y, . . . 9(x,, . . . . xk) will denote the subgraph of 9 spanned by the vertices x1, . . . . xA. u(x), the valence of X… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS