On cliques in graphs
- Cite this article as:
- Erdös, P. Israel J. Math. (1966) 4: 233. doi:10.1007/BF02771637
- 91 Views
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.