Rank decomposability in incident spaces Original Research Article

A set of matrices M is rank decomposable if each matrix T in M is the sum of r rank one matrices in M, where r is the rank of T. We show that an incidence space, i.e. the set of matrices supported on a given pattern, is rank decomposable if and only if the bipartite graph associated with the pattern is chordal.