On the Number of Triangles Contained in Certain Graphs

DOI10.4153/CMB-1964-007-3zbMath0121.40302OpenAlexW2322925531MaRDI QIDQ5733172

Paul Erdős

Publication date: 1964

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1964-007-3

zbMATH Keywords

topology

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (3)

Some corollaries of a theorem of Whitney on the chromatic polynomial ⋮ On \(q\)-analogues and stability theorems ⋮ The maximum number of triangles in a \(K_4\)-free graph

This page was built for publication: On the Number of Triangles Contained in Certain Graphs