SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Property testing in massive graphs
Handbook of massive data sets
Testing subgraphs in directed graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of Algorithms
Three theorems regarding testing graph properties
Random Structures & Algorithms
A characterization of easily testable induced subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A lower bound for testing juntas
Information Processing Letters
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
ω-Regular languages are testable with a constant number of queries
Theoretical Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Probabilistic abstraction for model checking: An approach based on property testing
ACM Transactions on Computational Logic (TOCL)
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the Randomness Complexity of Property Testing
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Benefits of Adaptivity in Property Testing of Dense Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
On proximity oblivious testing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Finding maximum degrees in hidden bipartite graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Generating all subsets of a finite set with disjoint unions
Journal of Combinatorial Theory Series A
Introduction to testing graph properties
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
On Proximity-Oblivious Testing
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
Let G be a graph on n vertices and suppose that at least $\epsilon n^2$ edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on $c k\,{\rm ln}\,k/ \epsilon^2$ vertices are not k-colorable, where c 0 is an absolute constant. If G is as above for k=2, then most induced subgraphs on $\frac{({\rm ln} (1/\epsilon))^b}{\epsilon}$ are nonbipartite, for some absolute positive constant b, and this is tight up to the polylogarithmic factor. Both results are motivated by the study of testing algorithms for k-colorability, first considered by Goldreich, Goldwasser, and Ron in, [J. ACM, 45 (1998), pp. 653--750], and improve the results in that paper.