ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Φ\Phi be a computable graph property. For a graph GG and positive integer kk, let #\textscIndSub(Φ)\#{\textsc{IndSub}}(\Phi) denote the problem of counting the kk-vertex subsets of GG that induce a graph satisfying Φ\Phi, parameterized by kk. Suppose that there are infinitely many positive integers kk such that Φ\Phi is neither true nor false on all graphs with kk vertices.

Induced-subgraph counting hardness conjecture. Then #\textscIndSub(Φ)\#{\textsc{IndSub}}(\Phi) is #W[1]\#{\mathsf{W[1]}}-hard.

This conjecture proposes an explicit criterion for the #W[1]\#{\mathsf{W[1]}}-hardness of induced-subgraph counting problems. The known dichotomy gives that every such problem is either fixed-parameter tractable or #W[1]\#{\mathsf{W[1]}}-hard, while the conjecture aims to characterize the hard cases; its status is not resolved in the supplied source.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.