The maximum number of triangles in a K₄-free graph

DOI10.1016/S0012-365X(98)00120-4MaRDI QIDQ1297475zbMATH OpenFDO

Authors Jürgen Eckhoff

Publication date 4 April 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00120-4

zbMATH Keywords

\(K_4\)-free graphsclique numberTurán graph

Mathematics Subject Classification ID

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

Recommendations

• On the number of edge-disjoint triangles in \(K_4\)-free graphs
• The maximum number of triangles in \(F_k\)-free graphs
• Packing triangles in \(K_4\)-free graphs
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• scientific article; zbMATH DE number 1080073

Cites work

• Dependence polynomials
• scientific article; zbMATH DE number 3752881 (Why is no real title available?)
• scientific article; zbMATH DE number 3529891 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Lower bounds on the number of triangles in a graph
• On a theorem of Rademacher-Turán
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the Number of Triangles Contained in Certain Graphs
• Shadows of colored complexes.
• Sur les relations symétriques dans l'ensemble fini
• The number of triangles in a \(K_ 4\)-free graph

Cited in

(16)

• A new Turán-type theorem for cliques in graphs
• The number of 4-cycles in triangle-free oriented graphs
• Many triangles with few edges
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
• Cliques in graphs excluding a complete graph minor
• scientific article; zbMATH DE number 1047729 (Why is no real title available?)
• Tree densities in sparse graph classes
• A Note on the Number of Triangles in Graphs Without the Suspension of a Path on Four Vertices
• Maximum cardinality neighbourly sets in quadrilateral free graphs
• On clique values identities and Mantel-type theorems
• The maximum number of triangles in \(F_k\)-free graphs
• On the maximum number of cliques in a graph embedded in a surface
• Maximal induced matchings in K₄-free and K₅-free graphs
• Face vectors of flag complexes
• A Kruskal-Katona type theorem for graphs
• On the maximum number of cliques in a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297475)