Upper Bounds on the Order of a Clique of a Graph

Ashok T. Amin, S. L. Hakimi · SIAM Journal on Applied Mathematics · 1972

This note presents an upper bound on the order of a largest complete subgraph (a clique) of a graph. Other upper bounds are given and the relationship between this bound and an existing bound is discussed.

Read the paper · More papers on PaperTik