On the Number of Complete Subgraphs of a Graph

Abstract

A graph G n consists of n nodes some pairs of which are joined by a single edge. A complete k-graph has k nodes and edges. Erdos [1] proved that if a graph G n has edges, then it contains at least complete 3-graphs if it contains any at all. The main object of this note is to extend this result to complete k-graphs.