ECCC-Report TR22-184https://eccc.weizmann.ac.il/report/2022/184Comments and Revisions published for TR22-184en-usWed, 28 Dec 2022 16:24:08 +0200
Paper TR22-184
| Testing in the bounded-degree graph model with degree bound two |
Oded Goldreich,
Laliv Tauber
https://eccc.weizmann.ac.il/report/2022/184Considering the bounded-degree graph model, we show that if the degree bound is two,
then every graph property can be tested within query complexity that only depends on the proximity parameter.
Specifically, the query complexity is ${\rm poly}(1/\epsilon)$, where $\epsilon$ denotes the proximity parameter.
The key observation is that a graph of maximum degree two consists of a collection of paths and cycles,
and that a collection of long paths and cycles is relatively close (in this model) to a single cycle. Wed, 28 Dec 2022 16:24:08 +0200https://eccc.weizmann.ac.il/report/2022/184