| Abstrakt: |
Let C and A be (0, 1)-valued matrices with no zero columns. Fulkerson has shown that the extreme points of { x: Cx ≤ 1, x ≥ 0} are given by the rows of A and their projections and the extreme points of { x: Ax ≤ 1, x ≥ 0} are given by the rows of C and their projections if and only if the maximal rows of C and A are the incidence vectors of maximal cliques and anticliques, respectively, of a perfect graph. This theorem is discussed and a new proof is given for the 'only if' implication. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink