On cliques in graphs (original) (raw)

• 2360 Accesses
• 680 Citations
• 16 Altmetric
• Explore all metrics

Abstract

A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph with_n_ nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Reference

Author information

Authors and Affiliations

1. University of Alberta, Edmonton, Canada
   J. W. Moon & L. Moser

Authors

1. J. W. Moon
2. L. Moser

Rights 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: 07 April 1965
• Issue date: March 1965
• DOI: https://doi.org/10.1007/BF02760024

Keywords