It is known that for a graph on n vertices [n(2)/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. (C) 1995 Academic Press, Inc. [References: 23]
展开▼
