Triangles in an Ordinary Graph
- 1 January 1963
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 15, 33-41
- https://doi.org/10.4153/cjm-1963-004-7
Abstract
An ordinary graph is a finite linear graph which contains no loops or multiple edges, and in which all edges are undirected. In such a graph G, let N, L, and T denote respectively the number of nodes, edges, and triangles. One problem, suggested by P. Erdös (1), is to determine the minimum number of triangles when the number of edges is specified, subject to suitable restrictions.Keywords
This publication has 3 references indexed in Scilit:
- On Complementary GraphsThe American Mathematical Monthly, 1956
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946