2 problems

The Dress Conjecture. The rank of $G$ satisfies

Let $r\geq 2$, and let a reduced graph mean a graph with no pair of vertices that can be removed without changing the relevant adjacency-matrix rank. Write $m(r)$ for … Akbari–Came…