CMR  1.3.0
Perfect Matrices

A matrix $$M \in \{0,1\}^{m \times n}$$ is called perfect if it is the clique-node incidence matrix of a perfect graph. In A Characterization of Perfect Matrices by Manfred W. Padberg (North-Holland Mathematics Studies, 1984) a characterization in terms of forbidden submatrices is provided.