Papers
Topics
Authors
Recent
Search
2000 character limit reached

Counting Small Induced Subgraphs Satisfying Monotone Properties

Published 14 Apr 2020 in cs.CC | (2004.06595v1)

Abstract: Given a graph property Φ\Phi, the problem #IndSub(Φ)\#\mathsf{IndSub}(\Phi) asks, on input a graph GG and a positive integer kk, to compute the number of induced subgraphs of size kk in GG that satisfy Φ\Phi. The search for explicit criteria on Φ\Phi ensuring that #IndSub(Φ)\#\mathsf{IndSub}(\Phi) is hard was initiated by Jerrum and Meeks [J. Comput. Syst. Sci. 15] and is part of the major line of research on counting small patterns in graphs. However, apart from an implicit result due to Curticapean, Dell and Marx [STOC 17] proving that a full classification into "easy" and "hard" properties is possible and some partial results on edge-monotone properties due to Meeks [Discret. Appl. Math. 16] and D\"orfler et al. [MFCS 19], not much is known. In this work, we fully answer and explicitly classify the case of monotone, that is subgraph-closed, properties: We show that for any non-trivial monotone property Φ\Phi, the problem #IndSub(Φ)\#\mathsf{IndSub}(\Phi) cannot be solved in time f(k)⋅∣V(G)∣o(k/log⁡1/2(k))f(k)\cdot |V(G)|^{o(k/ {\log^{1/2}(k)})} for any function ff, unless the Exponential Time Hypothesis fails. By this, we establish that any significant improvement over the brute-force approach is unlikely; in the language of parameterized complexity, we also obtain a #W[1]\#\mathsf{W}[1]-completeness result.

Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.