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.
机构:
Hebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
He, Xiaocong
Li, Yongtao
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, HNP LAMA, Changsha 410083, Hunan, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Li, Yongtao
Feng, Lihua
论文数: 0引用数: 0
h-index: 0
机构:
Cent South Univ, Sch Math & Stat, HNP LAMA, Changsha 410083, Hunan, Peoples R ChinaHebei Normal Univ, Sch Math Sci, Shijiazhuang 050024, Hebei, Peoples R China
Feng, Lihua
[J].
ELECTRONIC JOURNAL OF COMBINATORICS,
2024,
31
(03):
机构:
East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R ChinaEast China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
Zhao, Yanhua
论文数: 引用数:
h-index:
机构:
Huang, Xueyi
Guo, Hangtian
论文数: 0引用数: 0
h-index: 0
机构:
East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R ChinaEast China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
机构:
Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Univ Bordeaux 1, LaBRI UMR CNRS 5800, F-33405 Talence, FranceZhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
Chen, Min
Raspaud, Andre
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bordeaux 1, LaBRI UMR CNRS 5800, F-33405 Talence, FranceZhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China