On the Number of Triangles Contained in Certain Graphs
Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 53-56

Voir la notice de l'article provenant de la source Cambridge

DOI

Let G(n;m) denote a graph of n vertices and m edges. Vertices of G will be denoted by x1, ..., y1 ...; edges will be denoted by (x, y) and triangles by (x, y, z). (G - x1-x2 - ... - xk) will denote the graph G from which the vertices x1, ..., xk and all edges incident to them have been omitted G - (xi, xj) denotes the graph G from which the edge (xi, xj) has been omitted.
Erdös, P. On the Number of Triangles Contained in Certain Graphs. Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 53-56. doi: 10.4153/CMB-1964-007-3
@article{10_4153_CMB_1964_007_3,
     author = {Erd\"os, P.},
     title = {On the {Number} of {Triangles} {Contained} in {Certain} {Graphs}},
     journal = {Canadian mathematical bulletin},
     pages = {53--56},
     year = {1964},
     volume = {7},
     number = {1},
     doi = {10.4153/CMB-1964-007-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-007-3/}
}
TY  - JOUR
AU  - Erdös, P.
TI  - On the Number of Triangles Contained in Certain Graphs
JO  - Canadian mathematical bulletin
PY  - 1964
SP  - 53
EP  - 56
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-007-3/
DO  - 10.4153/CMB-1964-007-3
ID  - 10_4153_CMB_1964_007_3
ER  - 
%0 Journal Article
%A Erdös, P.
%T On the Number of Triangles Contained in Certain Graphs
%J Canadian mathematical bulletin
%D 1964
%P 53-56
%V 7
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-007-3/
%R 10.4153/CMB-1964-007-3
%F 10_4153_CMB_1964_007_3

Cité par Sources :