, Volume 4, Issue 4, pp 233-234

On cliques in graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.