Israel Journal of Mathematics

, Volume 3, Issue 1, pp 23–28

On cliques in graphs

  • J. W. Moon
  • L. Moser
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    P. Turán,On the theory of graphs, Colloq. Math.3 (1954), 19–30.MATHGoogle Scholar

Copyright information

© Hebrew University 1965

Authors and Affiliations

  • J. W. Moon
    • 1
  • L. Moser
    • 1
  1. 1.University of AlbertaEdmontonCanada

Personalised recommendations