Abstract
A geometric graph G is a graph whose vertex set is a set P n of n points on the plane in general position, and whose edges are straight line segments (which may cross) joining pairs of vertices of G. We say that G contains a convex r-gon if its vertex and edge sets contain, respectively, the vertices and edges of a convex polygon with r vertices. In this paper we study the following problem: Which is the largest number of edges that a geometric graph with n vertices may have in such a way that it does not contain a convex r-gon? We give sharp bounds for this problem. We also give some bounds for the following problem: Given a point set, how many edges can a geometric graph with vertex set P n have such that it does not contain a convex r-gon?
A result of independent interest is also proved here, namely: Let P n be a set of n points in general position. Then there are always three concurrent lines such that each of the six wedges defined by the lines contains exactly \(\lfloor \frac{n}{6} \rfloor\) or \(\lceil \frac{n}{6} \rceil\) elements of P n .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Creighton, R., Buck, E.F.: Math. Mag., 22, 195–98 (1948-1949)
Erdös, P., Szekeres, G.: A Combinatorial Problem in Geometry. Composito Mathematica 2, 463–470 (1935)
Matouusek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)
Karoly, G., Pach, J., Toth, G.: Ramsey-Type results for geometric graphs. I Discrete Comput. Geom. 18, 247–255 (1997)
Karoly, G., Pach, J., Toth, G., Valtr, P.: Ramsey-Type results for geometric graphs II. Discrete Comput. Geom. 20, 375–388 (1998)
Pach, J.: Geometric graph theory. In: Surveys in combinatorics, Canterbury. London Math. Soc. Lecture Note Ser., vol. 267, pp. 167–200. Cambridge Univ. Press, Cambridge (1999)
Turán, P.: On an extremal problem in Graph Theory. Mat. Fiz. Lapok 48, 436–452 (1941)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nara, C., Sakai, T., Urrutia, J. (2003). Maximal Number of Edges in Geometric Graphs without Convex Polygons. In: Akiyama, J., Kano, M. (eds) Discrete and Computational Geometry. JCDCG 2002. Lecture Notes in Computer Science, vol 2866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44400-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-44400-8_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20776-4
Online ISBN: 978-3-540-44400-8
eBook Packages: Springer Book Archive