Abstract
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.
Similar content being viewed by others
Reference
P. Turán,On the theory of graphs, Colloq. Math.3 (1954), 19–30.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moon, J.W., Moser, L. On cliques in graphs. Israel J. Math. 3, 23–28 (1965). https://doi.org/10.1007/BF02760024
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02760024