Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T07:44:13.902Z Has data issue: false hasContentIssue false

On Subgraphs of the Complete Bipartite Graph

Published online by Cambridge University Press:  20 November 2018

P. Erdös
Affiliation:
University College, London
J. W. Moon
Affiliation:
University College, London
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.

G(n) denotes a graph of n vertices and Ḡ(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let Ck(G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k

1

where the minimum is over all graphs G(n).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1964