On Subgraphs of the Complete Bipartite Graph
- 1 March 1964
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 7 (1) , 35-39
- https://doi.org/10.4153/cmb-1964-003-8
Abstract
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).Keywords
This publication has 1 reference indexed in Scilit:
- On Chromatic Bipartite GraphsMathematics Magazine, 1962