Counting Unlabeled Colored Trees With Maximum Independent Set Size Constraints
The problem requires counting unlabeled unrooted colored trees with maximum independent set size falling in a given range, which is an extended variant of classic unlabeled unrooted tree counting, so we can adapt standard techniques for that problem.
For unlabeled rooted trees, the generating function $F$ satisfies $F = x\mathcal{E}(F)$, where ...
Posted on Tue, 26 May 2026 19:13:22 +0000 by isurgeon