The number of triangles in a K_ 4-free graph

DOI10.1016/0012-365X(88)90021-0MaRDI QIDQ1112062zbMATH OpenOpenAlexFDO

Authors David C. Fisher

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90021-0

zbMATH Keywords

complete 3-graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

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.

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3752881 (Why is no real title available?)
• scientific article; zbMATH DE number 3185004 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• On the theory of graphs
• Triangles in an Ordinary Graph

Cited in

(8)

• Bounds on the number of complete subgraphs
• The maximum number of triangles in a \(K_4\)-free graph
• The number of 4-cycles in triangle-free oriented graphs
• On the number of edges of quadrilateral-free graphs
• scientific article; zbMATH DE number 1420924 (Why is no real title available?)
• On clique values identities and Mantel-type theorems
• scientific article; zbMATH DE number 5584780 (Why is no real title available?)
• The maximum number of triangles in \(F_k\)-free graphs

This page was built for publication: The 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 Q1112062)