For integers m, n greater than or equal to 2, let f(m, n) be the minim
um order of a graph where every vertex belongs to both a clique of car
dinality m and an independent set of cardinality n. We show that f(m,
n) = [(root m - 1 + root n - 1)(2)]. (C) 1997 John Wiley & Sons, Inc.