Israel Journal of Mathematics

, Volume 4, Issue 4, pp 233–234 | Cite as

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.


Group Theory Complete Graph Small Integer Absolute Constant Present Note 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    J. W. Moon and L. Moser,On cliques in graphs, Israel J. of Math.3 (1965), 23–28.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Hebrew University 1966

Authors and Affiliations

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

Personalised recommendations