Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T09:40:14.281Z Has data issue: false hasContentIssue false

On the Number of Triangles Contained in Certain Graphs

Published online by Cambridge University Press:  20 November 2018

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1964