The maximum number of triangles in a \(K_4\)-free graph
type: Item
instance of: scholarly article
title: The maximum number of triangles in a \(K_4\)-free graph
zbMATH Open document ID: 0933.05078
DOI: 10.1016/S0012-365X(98)00120-4
author: Jürgen Eckhoff
published in: Discrete Mathematics
publication date: 2000-04-04T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 1321840
zbMATH Keywords: clique number
zbMATH Keywords: Turán graph
zbMATH Keywords: \(K_4\)-free graphs
MaRDI profile type: Publication
cites work: On the connection between chromatic number, maximal clique and minimal degree of a graph
cites work: On a theorem of Rademacher-Turán
cites work: Q5724802
cites work: On the Number of Triangles Contained in Certain Graphs
cites work: The number of triangles in a \(K_ 4\)-free graph
cites work: Lower bounds on the number of triangles in a graph
cites work: Dependence polynomials
cites work: Shadows of colored complexes.
cites work: Q4106232
cites work: Q3936767
cites work: Sur les relations symétriques dans l'ensemble fini
description: scientific article; zbMATH DE number 1321840