6 problems
Matching
Graph Complement Conjecture. For any graph ,
Let be a sign pattern, and let denote its minimum rank over the reals while denotes its minimum rank over the rationals. Ration…
Weak Graph Complement Conjectures. There exist universal constants such that, for every graph ,
Positive semidefinite Graph Complement Conjecture. For any graph ,
For a graph on vertices, let be the set of real symmetric matrices whose off-diagonal zero pattern is prescribed by adjacency in . Define as the minimum r…
Let denote the minimum cardinality of a subgraph complementation system for a graph , and fix a natural number . A minimal forbidden induced subgraph for the propert…