Previous |  Up |  Next

Article

Title: On the number of complete subgraphs and circuits contained in graphs (English)
Author: Erdős, Pál
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 94
Issue: 3
Year: 1969
Pages: 290-296
.
Category: math
.
MSC: 05C20
idZBL: Zbl 0177.52502
idMR: MR0252253
DOI: 10.21136/CPM.1969.108598
.
Date available: 2009-09-23T08:07:31Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/108598
.
Reference: [1] P. Erdös: On a theorem of Rademacher-Turan.Illinois J. Math. 6 (1962), 122-127. MR 0137661
Reference: [2] P. Erdös: Some theorems on graphs.Riveon lematematika, 10 (1955), 13-16 (in Hebrew). MR 0081469
Reference: [3] P. Erdös: Some recent results on extremal problems in graph theory.Theory of graphs, International Symposium, Rome 1966, p. 117-130.
Reference: [4] E. A. Nordhaus, B. M. Stewart: Priangles in an ordinary graph.Canad. J. Math. 15 (1963), 33-41. MR 0151957
Reference: [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. Zbl 0164.24604, MR 0233735
Reference: [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 0018405
.

Files

Files Size Format View
CasPestMat_094-1969-3_6.pdf 632.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo