Publications of (and about) Paul Erdös
Autor: Erdös, Pál
Title: On the number of triangles contained in certain graphs (In English)
Source: Can. Math. Bull. 7, 53-56 (1964).
Review: Let G(n; m) be a graph of n vertices and m edges. The following result holds: Consider a graph G(n; [n2/4]+l) and assume that if l \leq 0 it contains at least one triangle. Then it contains at least [n/2]+l-1 triangles.
Classif.: * 05C30 Enumeration of graphs and maps
05C38 Paths and cycles
Index Words: topology
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag