Removal lemma for infinitely-many forbidden hypergraphs and property testing

Simple item page
dc.creatorIshigami, Yoshiyasu
dc.date2006-12-21
dc.date2008-03-24
dc.date.accessioned2026-07-07T09:27:56Z
dc.date.available2026-07-07T09:27:56Z
dc.descriptionWe 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0612669
dc.identifierhttp://arxiv.org/abs/math/0612669
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157281
dc.subjectCombinatorics
dc.subject05C65;68W20;68W25
dc.titleRemoval lemma for infinitely-many forbidden hypergraphs and property testing
dc.typetext

Files

Collections

arXiv