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 Link Up With Treewidth? , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.