Empty Triangles in Good Drawings of the Complete Graph
- 136 Downloads
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any good drawing, the edges of three pairwise connected vertices form a Jordan curve which we call a triangle. We say that a triangle is empty if one of the two connected components it induces does not contain any of the remaining vertices of the drawing of the graph. We show that the number of empty triangles in any good drawing of the complete graph \(K_n\) with \(n\) vertices is at least \(n\).
KeywordsGood drawings Empty triangles Erdős–Szekeres type problems
This work was initiated during a research visit of Pedro Ramos and Vera Sacristán in May 2013 in Graz, Austria.
- 1.Aichholzer, O., Fabila-Monroy, R., Hackl, T., Huemer, C., Pilz, A., Vogtenhuber, B.: Lower bounds for the number of small convex \(k\)-holes. In: Proceedings of 24th Canadian Conference on Computational Geometry CCCG’12, Charlottetown, Canada, pp. 247–252. (2012)Google Scholar
- 3.Erdős, P.: Some more problems on elementary geometry. Aust. Math. Soc. Gaz. 5, 52–54 (1978)Google Scholar
- 4.Fulek, R., Ruiz-Vargas, A.J.: Topological graphs: empty triangles and disjoint matchings. In: Proceedings of 29th ACM Symposium on Computational Geometry (SoCG’13), Rio de Janeiro, Brazil, pp. 259–265 (2013)Google Scholar
- 11.Lloyd, E.L.: On triangulations of a set of points in the plane. In: 18th Annual Symposium on Foundations of Computer Science, pp. 228–240 (1977)Google Scholar