A property is one-sided error testable in p-degenerate graphs if and only if its forbidden-subgraph violations cannot be fragmented across disjoint high-degree neighborhoods.
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A characterization of one-sided error testable graph properties in bounded degeneracy graphs
A property is one-sided error testable in p-degenerate graphs if and only if its forbidden-subgraph violations cannot be fragmented across disjoint high-degree neighborhoods.