On cliques in graphs

Research output: Contribution to journalArticle

Abstract

Sharp bounds are found on the maximal number of sizes of cliques in a graph on n vertices.

Original languageEnglish (US)
Pages (from-to)419-421
Number of pages3
JournalIsrael Journal of Mathematics
Volume9
Issue number4
DOIs
StatePublished - Feb 1 1971

    Fingerprint

ASJC Scopus subject areas

  • Mathematics(all)

Cite this