Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Erdős, Pál. On the number of complete subgraphs and circuits contained in graphs. Časopis pro pěstování matematiky, Tome 94 (1969) no. 3, pp. 290-296. doi: 10.21136/CPM.1969.108598
@article{10_21136_CPM_1969_108598,
author = {Erd\H{o}s, P\'al},
title = {On the number of complete subgraphs and circuits contained in graphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {290--296},
year = {1969},
volume = {94},
number = {3},
doi = {10.21136/CPM.1969.108598},
mrnumber = {0252253},
zbl = {0177.52502},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/}
}
TY - JOUR AU - Erdős, Pál TI - On the number of complete subgraphs and circuits contained in graphs JO - Časopis pro pěstování matematiky PY - 1969 SP - 290 EP - 296 VL - 94 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1969.108598/ DO - 10.21136/CPM.1969.108598 LA - en ID - 10_21136_CPM_1969_108598 ER -
[1] P. Erdös: On a theorem of Rademacher-Turan. Illinois J. Math. 6 (1962), 122-127. | MR
[2] P. Erdös: Some theorems on graphs. Riveon lematematika, 10 (1955), 13-16 (in Hebrew). | MR
[3] P. Erdös: Some recent results on extremal problems in graph theory. Theory of graphs, International Symposium, Rome 1966, p. 117-130.
[4] E. A. Nordhaus, B. M. Stewart: Priangles in an ordinary graph. Canad. J. Math. 15 (1963), 33-41. | MR
[5] M. Simonovits: A method for solving extremal problems in graph theory. Stability problems. Theory of Graphs, Proc. Colloquium held at Tihany, Hungary, Acad. Press and Akad, Kiado 1968, 279-334. | MR | Zbl
[6] P. Turán: Eine Extremalaufgabe aus der Graphentheorie. Mat. es Fiz. Lapok, 48 (1941), 436-452 (written in Hungarian). See also P. Turan. On the theory of graphs, Coll. Math. 3(1954), 19-30. | MR
Cité par Sources :