Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences

Jakub Gajarsky, Petr Hlineny

Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists…