Removal lemma for infinitely-many forbidden hypergraphs and property testing
Combinatorics
2008-03-24 v2
Abstract
We give an extension of a graph result by Alon and Shapira. And it affirmatively settles a question on property testing raised by them. All monotone hypergraph properties and all hereditary partite hypergraph properties are testable. Our proof is constructive and based on a new hypergraph regularity lemma.
Cite
@article{arxiv.math/0612669,
title = {Removal lemma for infinitely-many forbidden hypergraphs and property testing},
author = {Yoshiyasu Ishigami},
journal= {arXiv preprint arXiv:math/0612669},
year = {2008}
}
Comments
13 pages