Upper Bounds on the Order of a Clique of a Graph

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.