| Article ID: | iaor19891044 |
| Country: | Germany |
| Volume: | 34 |
| Start Page Number: | 12 |
| End Page Number: | 27 |
| Publication Date: | Oct 1990 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Perz S., Rolewicz S. |
The weak Berge hypothesis states that a graph is perfect if and only if its complement is perfect. Previous proofs of this hypothesis have used combinatorial or polyhedral methods. In this paper, the concept of norms related to graphs is used to provide an alternative proof for the weak Berge hypothesis.