Triangles in an Ordinary Graph

DOI10.4153/CJM-1963-004-7zbMATH Open0115.17403MaRDI QIDQ5723656FDOQ5723656

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

Publication date: 1963

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

zbMATH Keywords

topology

Cited In (23)

• The exact minimum number of triangles in graphs with given order and size
• On extremal graphs containing no wheels
• Lower bounds on the number of triangles in a graph
• Minimizing the number of 5-cycles in graphs with given edge-density
• Extremal problems in graph theory
• The number of triangles in a \(K_ 4\)-free graph
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• On the Minimal Density of Triangles in Graphs
• Books versus triangles
• Supersaturation problem for the bowtie
• Title not available (Why is that?)
• Bounds on the number of complete subgraphs
• Asymptotic Structure for the Clique Density Theorem
• The clique density theorem
• Minimum number of affine simplices of given dimension
• Frustrated triangles
• The minimum number of triangles in graphs of given order and size
• Ordered and colored subgraph density problems
• Color the cycles
• Triangles in graphs without bipartite suspensions
• Asymptotic structure of graphs with the minimum number of triangles
• On complete subgraphs of different orders
• On the Hamiltonicity of triple systems with high minimum degree

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)