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.
No takes yet. Share an insight, caveat, or question.
Amin et al. (1972) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: