Every Property of Hyperfinite Graphs Is Testable
Every Property of Hyperfinite Graphs Is Testable
A $k$-disc around a vertex $v$ of a graph $G=(V,E)$ is the subgraph induced by all vertices of distance at most $k$ from $v$. We show that the structure of a planar graph on $n$ vertices, and with constant maximum degree $d$, is determined, up to the modification (insertion or …