I've been summarising treewidth as the minimal number of variables you have to carry from one stage to the next(s) to solve with dynamic programming. You're on

I've been summarising treewidth as the minimal number of variables you have to carry from one stage to the next(s) to solve with dynamic programming. You're on your own for fractional hypertreewidth though.