The number of triangles in a K_ 4-free graph

DOI10.1016/0012-365X(88)90021-0zbMATH Open0659.05056OpenAlexW2079412785MaRDI QIDQ1112062FDOQ1112062

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the theory of graphs
• Title not available (Why is that?)
• Triangles in an Ordinary Graph
• Title not available (Why is that?)

Cited In (8)

• On the number of edges of quadrilateral-free graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The number of 4-cycles in triangle-free oriented graphs
• Bounds on the number of complete subgraphs
• The maximum number of triangles in a \(K_4\)-free graph
• On clique values identities and Mantel-type theorems
• 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)