The number of triangles in a \(K_ 4\)-free graph

DOI10.1016/0012-365X(88)90021-0zbMath0659.05056OpenAlexW2079412785MaRDI QIDQ1112062

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

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

Related Items (3)

Bounds on the number of complete subgraphs ⋮ On clique values identities and mantel-type theorems ⋮ The maximum number of triangles in a \(K_4\)-free graph

Cites Work

• Triangles in an Ordinary Graph
• On the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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