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 University Press
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/}
}
[1] 1. Erdös, P., Some theorems on graphs. Riveon lematematika, 10(1955), 13–16 (in Hebrew). Google Scholar
[2] 2. Erdös, P., On a theorem of Rademacher-Turán. Illinois Journal of Math. 6(1952), 122–127. Google Scholar
[3] 3. Turán, P., Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48 (1941), 436–452 (in Hungarian). See also, P. Turán, On the theory of graphs. Colloquium Math. 3 (1954), 19-30. Google Scholar
Cité par Sources :