Removal lemma for infinitely-many forbidden hypergraphs and property testing

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Removal lemma for infinitely-many forbidden hypergraphs and property testing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Removal lemma for infinitely-many forbidden hypergraphs and property testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Removal lemma for infinitely-many forbidden hypergraphs and property testing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-531644

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.