Abstract: Given a real symmetric matrix A of rank r, the maximum size of a P-set of A does not exceed ⌊r/2⌋. In this work, we fully characterize the maximal graphs for which there is a real symmetric matrix attaining this bound.
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview