Testing hypergraph colorability

We study the problem of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is "far away" from the property. We prove that the fundamental problem of l-colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph. We present a testing algorithm that examines only (k l/e)O(k) entries of the adjacency matrix of the input hypergraph, where e is a distance parameter independent of the size of the hypergraph. The algorithm tests only a constant number of entries in the adjacency matrix provided that l, k, and e are constants. This result is a generalization of previous results about testing graph colorability.

[1]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[2]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.

[3]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

[4]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[5]  Noga Alon,et al.  Testing satisfiability , 2002, SODA '02.

[6]  Dana Ron,et al.  Testing metric properties , 2003, Inf. Comput..

[7]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[8]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[9]  Eldar Fischer,et al.  Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems , 2005 .

[10]  Ronitt Rubinfeld,et al.  Approximate checking of polynomials and functional equations , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11]  Christian Scheideler,et al.  A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems , 2000, STOC 2000.

[12]  Noga Alon,et al.  Random sampling and approximation of MAX-CSP problems , 2002, STOC '02.

[13]  Eldar Fischer,et al.  Testing graphs for colorable properties , 2001, SODA '01.

[14]  Christian Scheideler,et al.  A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) , 2000, STOC '00.

[15]  Christian Scheideler,et al.  Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma , 2000, SODA '00.

[16]  Benny Sudakov,et al.  Approximating coloring and maximum independent sets in 3-uniform hypergraphs , 2001, SODA '01.

[17]  P. Erdos-L Lovász.  Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .

[18]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[19]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[20]  Chi-Jen Lu.  Deterministic Hypergraph Coloring and Its Applications , 1998, RANDOM.

[21]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[22]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[23]  Artur Czumaj,et al.  Abstract Combinatorial Programs and Efficient Property Testers , 2005, SIAM J. Comput..

[24]  József Beck,et al.  An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.

[25]  D. Ron,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002 .

[26]  P. Gács,et al.  Algorithms , 1992 .

[27]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[28]  Noga Alon,et al.  Testing k-colorability , 2002, SIAM J. Discret. Math..

[29]  Artur Czumaj,et al.  Property Testing in Computational Geometry , 2000, ESA.

[30]  Michael A. Bender,et al.  Testing properties of directed graphs: acyclicity and connectivity , 2002, Random Struct. Algorithms.

[31]  Benny Sudakov,et al.  Approximate coloring of uniform hypergraphs , 1998, J. Algorithms.

[32]  Alan M. Frieze,et al.  Coloring Bipartite Hypergraphs , 1996, IPCO.

[33]  Eldar Fischer,et al.  Testing of matrix properties , 2001, STOC '01.

[34]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[35]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[36]  A BenderMichael,et al.  Testing properties of directed graphs , 2002 .

[37]  Lars Engebretsen,et al.  Property testers for dense constraint satisfaction programs on finite domains , 2002, Random Struct. Algorithms.

[38]  V. Rödl,et al.  On graphs with small subgraphs of large chromatic number , 1985, Graphs Comb..

[39]  Benny Sudakov,et al.  Approximate Coloring of Uniform Hypergraphs (Extended Abstract) , 1998, ESA.

[40]  Artur Czumaj,et al.  Coloring nonuniform hypergraphs: a new algorithmic approach to the general Lovász local lemma , 2000 .

[41]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[42]  Noga Alon,et al.  Coloring 2-colorable hypergraphs with a sublinear number of colors , 1996 .