MSO-dependence and clique-width characterization
Prove or refute that, for every hereditary graph class $C$, bounded clique-width, MSO-dependence, monadic MSO-dependence, CMSO-dependence, and monadic CMSO-dependence are equivalent properties.
References
A second interesting question concerns the model theoretic notion of dependence (see \cref{sec:mstable} for a definition). Similar to FO-stable classes, also FO-dependent classes have recently been shown to admit nice combinatorial characterizations~. This raises the question whether also MSO-dependence can be combinatorially characterized. It is natural to conjecture the following.
It is natural to conjecture the following.
For every hereditary graph class~$C$, the following are equivalent. \begin{enumerate} \item $C$ has bounded clique-width (or equivalently bounded rank-width). \item $C$ is MSO-dependent. \item $C$ is monadically MSO-dependent. \item $C$ is CMSO-dependent. \item $C$ is monadically CMSO-dependent. \end{enumerate}