In this research note we show that the worst-case number of perfect subgraphs needed to cover an n-vertex graph is between 0.5 lg n and lg n, where lg denotes the base 2 logarithm.