The problem of characterizing all the testable graph properties is considered by many to be
the most important open problem in the area of property testing. Our main result in this paper …

Property testing algorithms are" ultra"-efficient algorithms that decide whether a given object
(eg, a graph) has a certain property (eg, bipartiteness), or is significantly different from any …

Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and
suppose that at least ε n2 edges have to be deleted from it to make it H-free. We show that in …

Property testing deals with tasks where the goal is to distinguish between the case that an
object (eg, function or graph) has a prespecified property (eg, the function is linear or the …

For a boolean formula φ on n variables, the associated property Pφ is the collection of n-bit
strings that satisfy φ. We prove that there are 3CNF properties that require a linear number of …

A graph property is called monotone if it is closed under taking (not necessarily induced)
subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many …

In a maximum-r-constraint satisfaction problem with variables {x1, x2,…, xn}, we are given
Boolean functions f1, f2,…, fm each involving r of the n variables and are to find the …

Let? We settle this question almost completely by showing that, quite surprisingly, for any
graph other than the paths of lengths 1, 2 and 3, the cycle of length 4, and their …

We consider the problem of distribution-free property-testing of functions. In this setting of
property-testing, the distance between functions is measured with respect to a fixed but …

We present sublinear‐time (randomized) algorithms for finding simple cycles of length at
least and tree‐minors in bounded‐degree graphs. The complexity of these algorithms is …