FOMOD is constant-time testable on bounded-degree bounded-component-size graphs by tailoring Hanf normal form and using a number-theoretic patchability condition to combine local samples into global information.
Every minor-closed property of sparse graphs is testable.Advances in Mathematics, 223(6):2200 – 2218
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constant time testability of first-order logic with modulo counting on finitary graphs
FOMOD is constant-time testable on bounded-degree bounded-component-size graphs by tailoring Hanf normal form and using a number-theoretic patchability condition to combine local samples into global information.