In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph [2]. Two conjectures are now known as the Perfect Graph Theorem and the Strong Perfect Graph Theorem. Both of these theorems make deteminin...

the foundation and corner stone ef mulla sadra's attitude toiuards man depends on his whole philosophical system of transcendent philosopfd, tuhich is plunged deep!j into his metapysical vieiv efman as a microcosm in whom creation returns to its source and multiplidty to its uniry; the prindples of his stttcfy provide, therefore, the last link in the rycle of his cosmology and a kry for th...