Extremal Graphs for Intersecting Triangles
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.
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial theory. Series B 1995-05, Vol.64 (1), p.89-100 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| ISSN: | 0095-8956 1096-0902 |
| DOI: | 10.1006/jctb.1995.1026 |