Sublinear separators, fragility and subexponential expansion
نویسندگان
چکیده
منابع مشابه
Sublinear separators, fragility and subexponential expansion
Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a result of Nešetřil and Ossona de Mendez. As an intermediate step, the proof uses a new kind of graph decompositions. The concept of graph classes with bounde...
متن کاملOn classes of graphs with strongly sublinear separators
For real numbers c, ε > 0, let Gc,ε denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c|V (H)|1−ε. A class G of graphs has strongly sublinear separators if G ⊆ Gc,ε for some c, ε > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in Gc,ε: there exist c > 0 such that f...
متن کاملBandwidth, treewidth, separators, expansion, and universality
We prove that planar graphs with bounded maximum degree have sublinear bandwidth. As a consequence for each γ > 0 every n-vertex graph with minimum degree ( 4 + γ)n contains a copy of every bounded-degree planar graph on n vertices. The proof relies on the fact that planar graphs have small separators. Indeed, we show more generally that for any class of bounded-degree graphs the concepts of su...
متن کاملBandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these parameters is sublinear in the number of vertices of G then so are all the others. This implies for example that graphs of fixed genus have sublinear bandwi...
متن کاملSublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Given d > 2 and a set of n grid points Q in <, we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in O(n 2 d log n) sublinear time such that Q has at most ( d d+1 + o(1))n points one either side of the hyper-plane, and at most cdwn d−1 d points within w 2 distance to the hyper-plane, where cd is a constant for fixed d. In particular, c3 = 1.209...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.09.001