## Removal lemma for infinitely-many forbidden hypergraphs and property testing (2008)

by
Yoshiyasu Ishigami

Citations: | 5 - 4 self |

### BibTeX

@MISC{Ishigami08removallemma,

author = {Yoshiyasu Ishigami},

title = {Removal lemma for infinitely-many forbidden hypergraphs and property testing },

year = {2008}

}

### OpenURL

### Abstract

We prove a removal lemma for infinitely-many forbidden hypergraphs. It affirmatively settles a question on property testing raised by Alon and Shapira (2005) [2, 3]. All monotone hypergraph properties and all hereditary partite hypergraph properties are testable. Our proof constructs a constant-time probabilistic algorithm to edit a small number of edges. It also gives a quantitative bound in terms of a coloring number of the property. It is based on a new hypergraph regularity lemma [14].