Density Theorems for Intersection Graphs of t-Monotone Curves
A curve γ in the plane is t-monotone if its interior has at most t − 1 vertical tangent points. A family of t-monotone curves F is simple if any two members intersect at most once. It is shown that if F is a simple family of n t-monotone curves with at least εn 2 intersecting pairs (disjoint pairs), then there exists two subfamilies F 1,F 2 ⊂ F of size δn each, such that every curve in F 1 intersects (is disjoint to) every curve in F 2, where δ depends only on ε. We apply these results to find pairwise disjoint edges in simple topological graphs.
KeywordsIntersection Graph Density Theorem Topological Graph Left Endpoint Disjoint Edge
- 15.Kozik, J., Krawczyk, T., Lasoń, M., Micek, P., Pawlik, A., Trotter, W., Walczak, B.: Triangle-free intersection graphs of segments in the plane with arbitrarily large chromatic number (submitted)Google Scholar
- 23.Suk, A.: Coloring intersection graphs of x-monotone curves in the plane (submitted)Google Scholar
- 24.Suk, A.: Disjoint edges in complete topological graphs (to appear)Google Scholar