On maximally saturated graphs

Motivated by a well known theorem of Turan in [7], we prove a partition theorem. We also point out that each of the family of maximally saturated graphs is chromatically unique which is a generalization of a result in [5].