Empty triangles in good drawings of the complete graph
Rights accessOpen Access
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 Kn with n vertices is at least n.
CitationAichholzer, O., Hackl, T., Pilz, A., Ramos, P., Sacristán, V., Vogtenhuber, B. Empty triangles in good drawings of the complete graph. "Graphs and combinatorics", 2015, vol. 31, núm. 2, p. 335-345.