Israel Journal of Mathematics

, Volume 3, Issue 1, pp 23–28

On cliques in graphs

Authors

  • J. W. Moon
    • University of Alberta
  • L. Moser
    • University of Alberta
Article

DOI: 10.1007/BF02760024

Cite this article as:
Moon, J.W. & Moser, L. Israel J. Math. (1965) 3: 23. doi:10.1007/BF02760024

Abstract

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.

Download to read the full article text

Copyright information

© Hebrew University 1965