An f(k) n^O(1) algorithm for #k-matching is claimed, implying #W[1] = FPT and falsifying ETH, #ETH, and W[1] ≠ FPT.
Juedes and Iyad A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
An f(k) n^O(1) algorithm for #k-matching is claimed, implying #W[1] = FPT and falsifying ETH, #ETH, and W[1] ≠ FPT.
-
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.