Name
Abstract | ||
|---|---|---|
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a xed subgraph H. The algorithm should accept graphs that are triangle-free and reject graphs that are far from being triangle-free in the sense that a constant fraction of the edges should be removed in order to obtain a triangle-free graph. The algorithm is allowed a small probability of error. This problem has been studied quite extensively in the past, but the focus was on dense graphs, that is, when d = ( n), where d is the average degree in the graph and n is the number of vertices. Here we study the complexity of the problem in general graphs, that is, for varying d. In this model a testing algorithm is allowed to ask neighbor queries (i.e., \what is the i-th neighbor of vertex v"), vertex-pair queries (i.e., \is there an edge between vertices v and u"), and degree queries (i.e., \what is the degree of vertex v"). Our main nding is a lower bound of ( n1=3) on the necessary number of queries that holds for every d < n1 (n), where (n) = o(1). Since when d = ( n) the number of queries sucien t for testing has been known to be independent of n, we observe an abrupt, threshold-like behavior of the complexity of testing around n. This lower bound holds for testing H-freeness of every non-bipartite subgraph H. Additionally, we provide sub-linear upper bounds for testing triangle-freeness that are at most quadratic in the stated lower bounds, and we describe a transformation from certain one-sided error lower bounds for testing subgraph-freeness to two-sided error lower bounds. Finally, in the course of our analysis we show that dense random Cayley graphs behave like quasi-random graphs in the sense that relatively large subsets of vertices have the \correct" edge density. The result for subsets of this size cannot be obtained from the known spectral techniques that only supply such estimates for much larger subsets. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1137/07067917X | Symposium on Discrete Algorithms |
Keywords | Field | DocType |
certain one-sided error,general graph,dense graph,large subsets,degree query,testing algorithm,average degree,testing triangle-freeness,general graphs,triangle-free graph,dense random cayley graph,lower bound,upper bound,randomized algorithms,property testing,approximation algorithms,random graph,cayley graph,cayley graphs,probability of error | Sublinear function,Discrete mathematics,Approximation algorithm,Combinatorics,Property testing,Random graph,Vertex (geometry),Upper and lower bounds,Cayley graph,Chordal graph,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 2 | 0895-4801 |
ISBN | Citations | PageRank |
0-89871-605-5 | 32 | 1.54 |
References | Authors | |
10 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Tali Kaufman | 2 | 499 | 38.33 |
| michael krivelevich | 3 | 1688 | 179.90 |
| Dana Ron | 4 | 3164 | 342.97 |