Abstract. Sandwiched between the clique number and chromatic numbers of a graph, both NP-complete computational problems, lies the theta function of Lovasz, which can be computed in polynomial time. In this talk, we define and explore some basic properties of Lovasz's idea.