Extremal Graphs for Intersecting Triangles

P. Erdős, Z. Füredi, R. J. Gould, D. S. Gunderson

Research output: Contribution to journalArticle

17 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)89-100
Number of pages12
JournalJournal of Combinatorial Theory. Series B
Volume64
Issue number1
DOIs
Publication statusPublished - May 1995

Fingerprint

Extremal Graphs
Triangle
Sufficient
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

Extremal Graphs for Intersecting Triangles. / Erdős, P.; Füredi, Z.; Gould, R. J.; Gunderson, D. S.

In: Journal of Combinatorial Theory. Series B, Vol. 64, No. 1, 05.1995, p. 89-100.

Research output: Contribution to journalArticle

Erdős, P. ; Füredi, Z. ; Gould, R. J. ; Gunderson, D. S. / Extremal Graphs for Intersecting Triangles. In: Journal of Combinatorial Theory. Series B. 1995 ; Vol. 64, No. 1. pp. 89-100.
@article{21f93e44db7a4fa4ad7a5003eb0da2f2,
title = "Extremal Graphs for Intersecting Triangles",
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.",
author = "P. Erdős and Z. F{\"u}redi and Gould, {R. J.} and Gunderson, {D. S.}",
year = "1995",
month = "5",
doi = "10.1006/jctb.1995.1026",
language = "English",
volume = "64",
pages = "89--100",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Extremal Graphs for Intersecting Triangles

AU - Erdős, P.

AU - Füredi, Z.

AU - Gould, R. J.

AU - Gunderson, D. S.

PY - 1995/5

Y1 - 1995/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0041707505&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0041707505&partnerID=8YFLogxK

U2 - 10.1006/jctb.1995.1026

DO - 10.1006/jctb.1995.1026

M3 - Article

AN - SCOPUS:0041707505

VL - 64

SP - 89

EP - 100

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 1

ER -