Quasipolynomiality of the Smallest Missing Induced Subgraph

06/19/2023

∙

by   David Eppstein, et al.

∙

0

∙

share

We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an n-vertex graph, in time n^O(log n). We show that under the Exponential Time Hypothesis this quasipolynomial time bound is optimal. We also consider variations of the problem in which either the missing subgraph or the given graph comes from a restricted graph family; for instance, we prove that the smallest missing planar induced subgraph of a given planar graph can be found in polynomial time.