Author/Authors :
Erdos، نويسنده , , P. and Furedi، نويسنده , , Z. and Gould، نويسنده , , R.J. and Gunderson، نويسنده , , D.S.، نويسنده ,
Abstract :
It is known that for a graph on n vertices [n2/4] + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex.
