Triangles in an Ordinary Graph

DOI10.4153/CJM-1963-004-7MaRDI QIDQ5723656zbMATH OpenFDO

Authors E. A. Nordhaus, B. M. Stewart

Publication date 1963

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1963-004-7

zbMATH Keywords

topology

Cited in

(24)

• The number of triangles in a \(K_ 4\)-free graph
• Bounds on the number of complete subgraphs
• The minimum number of triangles in graphs of given order and size
• Frustrated triangles
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• Triangles in graphs without bipartite suspensions
• Books versus triangles
• The clique density theorem
• On the Minimal Density of Triangles in Graphs
• Lower bounds on the number of triangles in a graph
• Color the cycles
• On complete subgraphs of different orders
• Extremal problems in graph theory
• scientific article; zbMATH DE number 7020671 (Why is no real title available?)
• Minimum number of affine simplices of given dimension
• The exact minimum number of triangles in graphs with given order and size
• Asymptotic Structure for the Clique Density Theorem
• On the Hamiltonicity of triple systems with high minimum degree
• Minimizing the number of 5-cycles in graphs with given edge-density
• On extremal graphs containing no wheels
• Asymptotic structure of graphs with the minimum number of triangles
• Ordered and colored subgraph density problems
• A note on extremal constructions for the Erdős-Rademacher problem
• How many triangles can a graph have?

This page was built for publication: Triangles in an Ordinary Graph

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