Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
Can You Beat Treewidth?
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Separating modules of support-degree k equate to O(k)-subgraph counts, those of symmetric circuit size n^Θ(k) equate to Θ(k)-WL, and their multiplicities equate to differing automorphism cycle indices.
Strengthens the conditional running-time lower bound for Global Label Min-Cut under ETH to (np)^{o(log n / log log n)} via a deterministic reduction.
citing papers explorer
-
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties
Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
-
Graph Isomorphism and Representation Theory
Separating modules of support-degree k equate to O(k)-subgraph counts, those of symmetric circuit size n^Θ(k) equate to Θ(k)-WL, and their multiplicities equate to differing automorphism cycle indices.