Triangles in an Ordinary Graph
From MaRDI portal
Publication:5723656
Cited in
(22)- Ordered and colored subgraph density problems
- Lower bounds on the number of triangles in a graph
- Frustrated triangles
- Bounds on the number of complete subgraphs
- On the Minimal Density of Triangles in Graphs
- On extremal graphs containing no wheels
- Some corollaries of a theorem of Whitney on the chromatic polynomial
- Extremal problems in graph theory
- Asymptotic structure of graphs with the minimum number of triangles
- The minimum number of triangles in graphs of given order and size
- The exact minimum number of triangles in graphs with given order and size
- Color the cycles
- The number of triangles in a \(K_ 4\)-free graph
- Triangles in graphs without bipartite suspensions
- On complete subgraphs of different orders
- On the Hamiltonicity of triple systems with high minimum degree
- Books versus triangles
- Minimizing the number of 5-cycles in graphs with given edge-density
- The clique density theorem
- Asymptotic Structure for the Clique Density Theorem
- scientific article; zbMATH DE number 7020671 (Why is no real title available?)
- Minimum number of affine simplices of given dimension
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)