Testability and repair of hereditary hypergraph properties

Authors:
Publisher website
Google Scholar
Abstract
Recent works of Alon–Shapira (A characterization of the (natural) graph properties testable with one‐sided error. Available at: http://www.math.tau.ac.il/∼nogaa/PDFS/heredit2.pdf) and Rödl–Schacht (Generalizations of the removal lemma, Available at: http://www.informatik.hu‐berlin.de/∼schacht/pub/preprints/gen_removal.pdf) have demonstrated that every hereditary property of undirected graphs or hypergraphs is testable with one‐sided error; informally, this means that if a graph or hypergraph satisfies that property “locally” with sufficiently high probability, then it can be perturbed (or “repaired”) into a graph or hypergraph which satisfies that property “globally.”In this paper we make some refinements to these results, some of which may be surprising. In the positive direction, we strengthen the results to cover hereditary properties of multiple directed polychromatic graphs and hypergraphs. In the case of undirected graphs, we extend the result to continuous graphs on probability spaces and show that the repair algorithm is “local” in the sense that it only depends on a bounded amount of data; in particular, the graph can be repaired in a time linear in the number of edges. We also show that local repairability also holds for monotone or partite hypergraph properties (this latter result is also implicitly in (Ishigamis work Removal lemma for infinitely‐many forbidden hypergraphs and property testing. Available at: arXiv.org: math.CO/0612669)). In the negative direction, we show that local repairability breaks down for directed graphs or for undirected 3‐uniform hypergraphs. The reason for this contrast in behavior stems from (the limitations of) Ramsey theory. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010
Funding Information
  • NSF (CCF-0649473)
  • MacArthur Foundation

This publication has 22 references indexed in Scilit: