Answer:
It states that a graph is perfect if the sizes of the largest clique, and the largest independent set, when multiplied together, equal or exceed the number of vertices of the graph, and the same is true for any induced subgraph
