We present a new polynomial-time algorithm for finding maximal cliques in graphs. As a corollary, we obtain new bounds on the famous Ramsey numbers in terms of the maximum and minimum vertex degrees... This description may be from another edition of this product.