The average cut-rank of graphs

Huy-Tung Nguyen, Sang-il Oum

The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $X\times (V(G)\setminus X)$ matrix over the binary field whose $(i,j)$-entry is $1$ if the vert…