Complement problems are not in the same class in parametrized complexity hierarchy? If not in $P$
The complement problems Minimum (Edge) Bipartization and MaxCut are both in FPT, so the conjecture is false.