# Additive approximation for edge-deletion problems | Annals of Mathematics

Abstract A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following algorithmic problem, called the edge-deletion problem; given a monotone property  and a graph G, compute the smallest number of edge deletions that are needed in order to turn G into a graph satisfying . We denote this quantity by E′(G). The first result of this paper states that the edge-deletion problem can be efficiently approximated for any monotone property. For any fixed ε>0 and any monotone property , there is a deterministic algorithm which, given a graph G=(V,E) of size n, approximates E′(G) in linear time O(|V|+|E|) to within an additive error of εn2. Given the above, a natural question is for which monotone properties one can obtain better additive approximations of E′. Our second main result essentially resolves this problem by giving a precise characterization of the monotone graph properties for which such approximations exist. (1) If there is a bipartite graph that does not satisfy , then there is a δ>0 for which it is possible to approximate E′ to within an additive error of n2−δ in polynomial time. (2) On the other hand, if all bipartite graphs satisfy , then for any δ>0 it is NP-hard to approximate E′ to within an additive error of n2−δ. While the proof of (1) is relatively simple, the proof of (2) requires several new ideas and involves tools from Extremal Graph Theory together with spectral techniques. Interestingly, prior to this work it was not even known that computing E′ precisely for the properties in (2) is NP-hard. We thus answer (in a strong form) a question of Yannakakis, who asked in 1981 if it is possible to find a large and natural family of graph properties for which computing E′ is NP-hard.

KEYWORDS

SHARE & LIKE

COMMENTS

ABOUT THE AUTHOR

### 数学年刊（Annals of Mathematics）

0 Following 0 Fans 0 Projects 674 Articles

SIMILAR ARTICLES

Abstract For any nondegenerate, quasi-homogeneous hypersurface singularity, we describe a family of moduli spaces, a virtual cycle, and a correspondin

Abstract For a large class of nonlinear Schrödinger equations with nonzero conditions at infinity and for any speed c less than the sound velocity, we

Abstract Let L2,p(ℝ2) be the Sobolev space of real-valued functions on the plane whose Hessian belongs to Lp. For any finite subset E⊂ℝ2 and p>2, let

Abstract We prove that for any group G in a fairly large class of generalized wreath product groups, the associated von Neumann algebra LG completely

Abstract We study the parity of 2-Selmer ranks in the family of quadratic twists of an arbitrary elliptic curve E over an arbitrary number field K. We

Abstract This paper has two main results. Firstly, we complete the parametrisation of all p-blocks of finite quasi-simple groups by finding the so-cal

Abstract We derive sharp Moser-Trudinger inequalities on the CR sphere. The first type is in the Adams form, for powers of the sublaplacian and for ge

Abstract We prove that isoparametric hypersurfaces with (g,m)=(6,2) are homogeneous, which answers Dorfmeister-Neher’s conjecture affirmatively and so

Abstract We prove the periodicity conjecture for pairs of Dynkin diagrams using Fomin-Zelevinsky’s cluster algebras and their (additive) categorificat

Abstract If F(x,y)∈ℤ[x,y] is an irreducible binary form of degree k≥3, then a theorem of Darmon and Granville implies that the generalized superellipt