Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six

TL;DR

This paper investigates the complexity of counting all subgraphs of size k in sparse graphs, revealing a sharp transition at k=6 where the problem shifts from solvable in linear time to likely infeasible.

Contribution

It establishes a clear boundary at k=6, proving linear-time algorithms exist for k<6 and likely do not for k≥6, deepening understanding of subgraph counting complexity.

Findings

Linear-time algorithms exist for subgraph counting when k<6.

For k≥6, subgraph counting cannot be solved in near-linear time assuming standard conjectures.

Identifies a computational threshold at size 6 for subgraph counting in sparse graphs.

Abstract

We consider the problem of counting all $k$-vertex subgraphs in an input graph, for any constant $k$. This problem (denoted sub-cnt$_k$) has been studied extensively in both theory and practice. In a classic result, Chiba and Nishizeki (SICOMP 85) gave linear time algorithms for clique and 4-cycle counting for bounded degeneracy graphs. This is a rich class of sparse graphs that contains, for example, all minor-free families and preferential attachment graphs. The techniques from this result have inspired a number of recent practical algorithms for sub-cnt$_k$. Towards a better understanding of the limits of these techniques, we ask: for what values of $k$ can sub-cnt$_k$ be solved in linear time? We discover a chasm at $k=6$. Specifically, we prove that for $k < 6$, sub-cnt$_k$ can be solved in linear time. Assuming a standard conjecture in fine-grained complexity, we prove that for all $k \geq 6$, sub-cnt$_k$ cannot be solved even in near-linear time.