Israel Journal of Mathematics

, Volume 4, Issue 4, pp 233–234

On cliques in graphs

  • P. Erdös


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.

Copyright information

© Hebrew University 1966

Authors and Affiliations

  • P. Erdös
    • 1
  1. 1.Technion-Israel Institute of TechnologyHaifa

Personalised recommendations