The relaxed confusion-number bound conjecture for signed graphs

Let $G$ be a graph of order $n \geq 1$, let $\sigma$ be a signing of $G$, and let $\ell(G,\sigma)$ denote the frustration index. Let $C_r(G,\sigma)$ denote the relaxed confusion number. The relaxed confusion-number bound conjecture. For every signed graph $(G,\sigma)$,

$$C_r(G,\sigma) \leq \min\left\{\ell(G,\sigma),\left\lceil \frac{3n}{5}-4 \right\rceil\right\}.$$

This conjecture combines the proposed general confusion-number bound with the expectation that the relaxed confusion number is at most the frustration index. The paper gives supporting results for particular signed graphs but leaves the general assertion open.