Hostname: page-component-f554764f5-nwwvg Total loading time: 0 Render date: 2025-04-10T12:58:15.959Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Triangles Contained in Certain Graphs

Published online by Cambridge University Press:  20 November 2018

P. Erdös
P. Erdös*
Affiliation:
University of Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 7 , Issue 1 , March 1964 , pp. 53 - 56
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Erdös, P., Some theorems on graphs. Riveon lematematika, 10(1955), 13–16 (in Hebrew).Google Scholar
2. Erdös, P., On a theorem of Rademacher-Turán. Illinois Journal of Math. 6(1952), 122–127.Google Scholar
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