The number of triangles in a \(K_ 4\)-free graph
type: Item
instance of: scholarly article
title: The number of triangles in a \(K_ 4\)-free graph
zbMATH Open document ID: 0659.05056
DOI: 10.1016/0012-365X(88)90021-0
author: David C. Fisher
published in: Discrete Mathematics
publication date: 1988-01-01T00:00:00Z
review text: The author shows that if a graph with e edges contains no complete 4- graphs then it contains at most \((e/3)^{3/2}\) complete 3-graphs.
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 4077262
zbMATH Keywords: complete 3-graphs
reviewed by: J. W. Moon
MaRDI profile type: Publication
cites work: Q3852212
cites work: Q5724802
cites work: Q5721211
cites work: Q3936767
cites work: Triangles in an Ordinary Graph
cites work: On the theory of graphs
full work available at URL: 0012-365x(88)90021-0
OpenAlex ID: W2079412785
description: scientific article; zbMATH DE number 4077262