The maximum number of triangles in a \(K_4\)-free graph

DOI10.1016/S0012-365X(98)00120-4zbMath0933.05078MaRDI QIDQ1297475

Jürgen Eckhoff

Publication date: 4 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

clique numberTurán graph\(K_4\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a theorem of Rademacher-Turán
• The number of triangles in a \(K_ 4\)-free graph
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• Dependence polynomials
• Shadows of colored complexes.
• Lower bounds on the number of triangles in a graph
• On the Number of Triangles Contained in Certain Graphs
• Sur les relations symétriques dans l'ensemble fini

Related Items (11)

Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ Many triangles with few edges ⋮ On the maximum number of cliques in a graph embedded in a surface ⋮ Face vectors of flag complexes ⋮ A Kruskal-Katona type theorem for graphs ⋮ The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) ⋮ On the maximum number of cliques in a graph ⋮ On clique values identities and mantel-type theorems ⋮ Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs ⋮ A new Turán-type theorem for cliques in graphs

This page was built for publication: The maximum number of triangles in a \(K_4\)-free graph