“…The answer is positive and the proof is trivial. In fact, it is 1 Such parameterizations were studied for many graph-theoretical and constraint satisfaction problems, see, for example, [2,6,13,17,18]. In other words, we can ask whether there is a 0-perfect forest of size at least n k − ( ∕ n k 2 + , respectively), where k is the parameter.…”