Counting Small Induced Subgraphs with Hereditary Properties

11/03/2021
by   Jacob Focke, et al.
0

We study the computational complexity of the problem #IndSub(Φ) of counting k-vertex induced subgraphs of a graph G that satisfy a graph property Φ. Our main result establishes an exhaustive and explicit classification for all hereditary properties, including tight conditional lower bounds under the Exponential Time Hypothesis (ETH): - If a hereditary property Φ is true for all graphs, or if it is true only for finitely many graphs, then #IndSub(Φ) is solvable in polynomial time. - Otherwise, #IndSub(Φ) is #𝖶[1]-complete when parameterised by k, and, assuming ETH, it cannot be solved in time f(k)· |G|^o(k) for any function f. This classification features a wide range of properties for which the corresponding detection problem (as classified by Khot and Raman [TCS 02]) is tractable but counting is hard. Moreover, even for properties which are already intractable in their decision version, our results yield significantly stronger lower bounds for the counting problem. As additional result, we also present an exhaustive and explicit parameterised complexity classification for all properties that are invariant under homomorphic equivalence. By covering one of the most natural and general notions of closure, namely, closure under vertex-deletion (hereditary), we generalise some of the earlier results on this problem. For instance, our results fully subsume and strengthen the existing classification of #IndSub(Φ) for monotone (subgraph-closed) properties due to Roth, Schmitt, and Wellnitz [FOCS 20].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2022

Counting Subgraphs in Somewhere Dense Graphs

We study the problems of counting copies and induced copies of a small p...
research
11/06/2020

Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders

Given a graph property Φ, we consider the problem 𝙴𝚍𝚐𝚎𝚂𝚞𝚋(Φ), where the ...
research
03/09/2021

Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies

We study the problems of counting the homomorphisms, counting the copies...
research
04/14/2020

Counting Small Induced Subgraphs Satisfying Monotone Properties

Given a graph property Φ, the problem #𝖨𝗇𝖽𝖲𝗎𝖻(Φ) asks, on input a graph ...
research
04/29/2021

Parameterized (Modular) Counting and Cayley Graph Expanders

We study the problem #EdgeSub(Φ) of counting k-edge subgraphs satisfying...
research
07/05/2018

Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness

We investigate the problem #IndSub(Φ) of counting all induced subgraphs ...
research
04/23/2019

Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness

We study the problem #IndSub(P) of counting all induced subgraphs of siz...

Please sign up or login with your details

Forgot password? Click here to reset