Extremal graphs for intersecting triangles
type: Item
instance of: scholarly article
title: Extremal graphs for intersecting triangles
zbMATH Open document ID: 0822.05036
author: Zoltán Füredi
author: Ronald Gould
author: David S. Gunderson
author: P. Erdős
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-07-04T00:00:00Z
review text: A \(k\)-fan is a graph with \(2k+ 1\) vertices consisting of \(k\) 3-cycles having one vertex in common. The authors show that if \(n\geq 50k^2\) and the graph \(G_n\) has more than \([n^2/4]+ k^2- ck\) edges, where \(c\) equals 1 or 3/2 according as \(k\) is odd or even, then \(G_n\) contains a \(k\)-fan; furthermore, the bound for the number of edges is best possible.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 767700
zbMATH Keywords: intersecting triangles
zbMATH Keywords: extremal graphs
zbMATH Keywords: fan
zbMATH Keywords: 3-cycles
reviewed by: J. W. Moon
MaRDI profile type: Publication
full work available at URL: jctb.1995.1026
OpenAlex ID: W2020049876
Wikidata QID: Q30049192
DOI: 10.1006/JCTB.1995.1026
description: scientific article; zbMATH DE number 767700