,
Mingjun Liu
Creative Commons Attribution 4.0 International license
Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems #IndSub(Φ) for fixed graph properties Φ: Given an input graph G and k ∈ ℕ, count the k-vertex subsets S ⊆ V(G) such that the induced subgraph G[S] satisfies Φ. For recursively enumerable Φ, it is known that #IndSub(Φ) is either #W[1]-hard or fixed-parameter tractable. A direct classification depending on Φ however still remains open. In particular, the status was open for the property of graphs without nontrivial automorphisms, also mentioned in a very recent survey on parameterized counting by Roth (Comput. Sci. Rev. 2026). This is a natural property that evades all currently known techniques for proving #W[1]-hardness, including a general toolkit based on Fourier analysis that was very recently introduced by Curticapean and Neuen (SODA 2025). In this paper, we show that counting induced k-vertex graphs without nontrivial automorphisms is #W[1]-hard by constructing "clique scaffolds", i.e., problem-specific restrictions of the property that enable a reduction from the k-clique problem. More generally, we show that for every finite group Q, counting k-vertex induced subgraphs with automorphism group Q is #W[1]-hard.
@InProceedings{curticapean_et_al:LIPIcs.IPEC.2026.31,
author = {Curticapean, Radu and Liu, Mingjun},
title = {{Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {31:1--31:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.31},
URN = {urn:nbn:de:0030-drops-282045},
doi = {10.4230/LIPIcs.IPEC.2026.31},
annote = {Keywords: induced subgraphs, counting complexity, parameterized complexity, dichotomy, automorphism group}
}