Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle

Abstract

We prove that, for every fixed nonempty graph $H$, induced-$H$-freeness is testable with ${\epsilon }^{-O_H(1)}$ queries on outerplanar graphs with no maximum-degree bound in the $\text{random-neighbor model}$, where each query at a vertex returns a uniformly random neighbor. Thus, the query complexity is polynomial in $1/\epsilon$ and independent of the number $n$ of vertices. Previously, the best bound known for this problem was the $\mathrm{poly}(\log n)$-query guarantee that follows from the general outerplanar-graph tester of Babu, Khoury, and Newman (2016) in the stronger $\text{adjacency-list model}$, which provides exact degree queries and indexed access to neighbors. Our tester has $\text{two-sided error}$, which is necessary in general: induced-$P_3$-freeness has no one-sided constant-query tester in the random-neighbor model, even on outerplanar graphs of maximum degree two.