Skip to main content
SpringerLink
Log in

On cliques in graphs

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Alberta, Edmonton, Canada

    J. W. Moon & L. Moser

Authors
  1. J. W. Moon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moon, J.W., Moser, L. On cliques in graphs. Israel J. Math. 3, 23–28 (1965). https://doi.org/10.1007/BF02760024

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02760024

Keywords

Search

Navigation