How many triangles can a graph have?

DOI10.1017/S0004972724000972MaRDI QIDQ6961961zbMATH OpenFDO

Authors Teeradej Kittipassorn, Kamil Popielarz

Publication date 10 July 2025

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972724000972

zbMATH Keywords

complete graphs in a graphnumber of triangles in a graphrealisable numberssubgraphs in a graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• Frustrated triangles
• scientific article; zbMATH DE number 4137789 (Why is no real title available?)
• scientific article; zbMATH DE number 3821782 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• On a theorem of Rademacher-Turán
• On the edge spectrum of saturated graphs for paths and stars
• On the number of complete subgraphs and circuits contained in graphs
• On the number of complete subgraphs and circuits in a graph
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• On the Number of Triangles Contained in Certain Graphs
• The maximum number of complete subgraphs in a graph with given maximum degree
• The number of cliques in graphs of given order and size
• Triangles in an Ordinary Graph

This page was built for publication: How many triangles can a graph have?

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