Separator theorems and Turán-type results for planar intersection graphs
نویسندگان
چکیده
منابع مشابه
Separator Theorems and Turán-type Results for Planar Intersection Graphs
We establish several geometric extensions of the Lipton-Tarjan separator theorem for planar graphs. For instance, we show that any collection C of Jordan curves in the plane with a total of m crossings has a partition into three parts C = S ∪C1 ∪C2 such that |S| = O( √ m), max{|C1|, |C2|} ≤ 2 3 |C|, and no element of C1 has a point in common with any element of C2. These results are used to obt...
متن کاملOn Ramsey - Turán type theorems for hypergraphs
Let H’ be an r-uniform hypergraph. Let g=g(n; F) be the minimal integer so that any r-uniform hypergraph on n vertices and more than g edges contains a subgraph isomorphic to H’. Let e=f(n; H’, en) denote the minimal integer such that every r-uniform hypergraph on n vertices with more than e edges and with no independent set of .sn vertices contains a subgraph isomorphic to H’. We show that if ...
متن کاملA Well-Connected Separator for Planar Graphs
We prove a separator theorem for planar graphs, which has been used to obtain polynomial time approximation schemes for the metric TSP [8] and the 2edge-connected and biconnected spanning subgraph problems [6] in unweighted planar graphs. We also prove an extension of the theorem which was used in [3] to find quasi-polynomial time approximation schemes for the weighted cases of the latter two p...
متن کاملTurán theorems and convexity invariants for directed graphs
This paper is motivated by the desire to evaluate certain classical convexity invariants (specifically, the Helly and Radon numbers) in the context of transitive closure of arcs in the complete digraph. To do so, it is necessary to establish several new Turán type results for digraphs and characterize the associated extremal digraphs. In the case of the Radon number, we establish the following ...
متن کاملDensity theorems for bipartite graphs and related Ramsey-type results
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve and generalize earlier results of various researchers. The proofs combine probabilistic arguments with some combinatorial ideas. In addition, these techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2008
ISSN: 0001-8708
DOI: 10.1016/j.aim.2008.06.002