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. © 1995 by Academic Press, Inc.
Cite
CITATION STYLE
APA
Erdös, P., Füredi, Z., Gould, R. J., & Gunderson, D. S. (1995). Extremal graphs for intersecting triangles. Journal of Combinatorial Theory, Series B, 64(1), 89–100. https://doi.org/10.1006/jctb.1995.1026
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free