On cliques in graphs
- Cite this article as:
- Moon, J.W. & Moser, L. Israel J. Math. (1965) 3: 23. doi:10.1007/BF02760024
- 888 Downloads
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.