Finite/cofinite regimes not covered by the rank-width lower bound

Determine whether the quadratic 2^{O(k^2)} rank-width dependence is necessary for the three remaining finite/cofinite \((\sigma,\rho)\)-set minimization regimes with \(0\notin\rho\): finite–finite, cofinite–finite, and the finite–cofinite pairs not satisfying \(0\in\sigma\) and \(1\in\rho\).

Background

The paper proves matching quadratic rank-width lower bounds when ρ\rho is cofinite and either σ\sigma is cofinite or 0σ0\in\sigma and 1ρ1\in\rho. These results settle the cofinite–cofinite minimization regime and a subfamily of the finite–cofinite regime.

Three finite/cofinite regimes remain incompletely covered. The finite–finite case lacks both large-clique validation and cofinite padding; the cofinite–finite case requires exact control of the unselected vertices; and the remaining finite–cofinite pairs require control of selected vertices without either a large clique or the independent-solution assumptions used in the paper.

References

Under 0\notin\rho, the three remaining finite/cofinite regimes are not yet fully covered; their structural obstacles are as follows.

Lower Bounds for Domination-Type Problems Parameterized by Rank-Width  (2608.18854 - Liu et al., 19 Aug 2026) in Section 5, subsection “The three remaining finite/cofinite regimes when \(0\notin\rho\)”