Cited By
View all- Fulek RRuiz-Vargas Ada Fonseca GLewiner TPeñaranda LChan TKlein R(2013)Topological graphsProceedings of the twenty-ninth annual symposium on Computational geometry10.1145/2462356.2462394(259-266)Online publication date: 17-Jun-2013
Abstract
It is shown that every complete $n$-vertex simple topological graph has at least Ω(n1/3) pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and Toth, which appears as problem 5 from chapter 9.5 in Research Problems in Discrete Geometry by Brass, Moser, and Pach.
References
[1]
. Alon, J. Spencer, The Probabilistic Method, Wiley, 3rd Edition (2008).
[2]
. K. Agarwal, M. van Kreveld, S. Suri, Label placement by maximum independent set in rectangles, Comput. Geom. Theory Appl. 11 (1998), 209--218.
[3]
. Asano, H. Imai, Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, J. Algorithms 4 (1983), 310--323.
[4]
P. Brass, W. Moser, J. Pach, Research Problems in Discrete Geometry. Berlin, Germany: Springer-Verlag, 2005.
[5]
. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4 (1989), 467--489.
[6]
. Ehrlich, S. Even, R.E. Tarjan, Intersection graphs of curves in the plane, J. Combinatorial Theory, Ser. B 21 (1979), 8--20.
[7]
. Erdos, A. Hajnal, Ramsey-type theorems, Discrete Appl. Math. 25 (1989), 37--52.
[8]
. Fox, J. Pach, Coloring $K_k$-free intersection graphs of geometric objects in the plane. In Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, 2008, 346--354.
[9]
J. Fox, J. Pach, Computing the Independence Number of Intersection Graphs, SODA 2011, 1161--1165.
[10]
. Fox, B. Sudakov, Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica 29 (2009), 153--196.
[11]
. J. Fowler, M.S. Paterson, S. L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett. 12 (1981), 133--137.
[12]
. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
[13]
D. S. Hochbaum, W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM 32 (1985), 130--136.
[14]
. Matousek, Geometric Discrepancy: An Illustrated Guide. Algorithms and combinatorics. 18. Berlin: Springer, 1999.
[15]
. Pach, Notes on geometric graph theory, in: Discrete and Computational Geometry (J.E. Goodman et al, eds.), DIMACS Series, Amer. Math. Soc. 6 (1991), 273--285.
[16]
. Pach, J. Solymosi, G. Tóth, Unavoidable Configurations in Complete Topological Graphs. Discrete Comput. Geom. 30 (2003), 311--320.
[17]
. Pach and G. Tóth, Disjoint edges in topological graphs, in: Combinatorial Geometry and Graph Theory (J. Akiyama et al., eds.), Lecture Notes in Computer Science 3330, Springer-Verlag, Berlin, 2005, 133--140.
[18]
. Tóth, Personal Communcation (2012).
Index Terms
- Disjoint edges in complete topological graphs
Recommendations
Topological graphs: empty triangles and disjoint matchings
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryA simple topological graph is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any two of them meet at most once. We present a novel tool for finding crossing free subgraphs in simple topological ...
Disjoint Edges in Complete Topological Graphs
It is shown that every complete $$n$$-vertex simple topological graph has at $$\varOmega (n^{1/3})$$ pairwise disjoint edges, and these edges can be found in polynomial time. This proves a conjecture of Pach and Tóth, which appears as Problem 5 from ...
Many disjoint edges in topological graphs
A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most ...
Comments
Information & Contributors
Information
Published In
Copyright © 2012 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2012
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SoCG '12: Symposium on Computational Geometry 2012
June 17 - 20, 2012
North Carolina, Chapel Hill, USA
Acceptance Rates
Overall Acceptance Rate 625 of 1,685 submissions, 37%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 102Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
Cited By
View all- Fulek RRuiz-Vargas Ada Fonseca GLewiner TPeñaranda LChan TKlein R(2013)Topological graphsProceedings of the twenty-ninth annual symposium on Computational geometry10.1145/2462356.2462394(259-266)Online publication date: 17-Jun-2013
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in