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

DOI10.1016/S0012-365X(98)00120-4zbMATH Open0933.05078MaRDI QIDQ1297475FDOQ1297475

Authors: Jürgen Eckhoff 

Publication date: 4 April 2000

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

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

zbMATH Keywords

clique number[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+graph&go=Go Tur��n graph]\(K_4\)-free graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

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

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)