A clique is a maximal complete subgraph of a graph. Moon and Moser obtained bounds for the maximum possible number of cliques of different sizes in a graph ofn vertices. These bounds are improved in this note.
KeywordsGroup Theory Complete Graph Small Integer Absolute Constant Present Note
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Hebrew University 1966