Browse · MathNet
Print18th Turkish Mathematical Olympiad
Turkey geometry
Problem
Let be the set of the edges and the diagonals of a convex -gon in the plane. We say that a subset of is intersecting if any pair of line segments belonging to intersects. Determine the maximum possible number of elements in the union of two intersecting sets.
Solution
The answer is . We will show that the answer is for a -gon if . Let be an intersecting set with . Since the number of vertices in is not greater than the number of line segments in , contains a cycle. Let and be two line segments in this cycle. Every line segment in the cycle, except and , intersects both and at their interior points. We conclude that the cycle contains an odd number of line segments and none of the vertices on the cycle lies inside the angle . Hence there is a positive integer and there are vertices in the order they lie on the polygon such that the cycle consists of the line segments for . (Indices are considered modulo .) Let us denote this collection by . Since is intersecting, the only other line segments in can be of the form where is a vertex of the polygon lying inside the angle . Since all such line segments must belong to . Let us denote the collection of these line segments by . Therefore if is an intersecting set with , then and where and are as described above.
Next we will show that if and are intersecting sets with , then and cannot be disjoint. Assume they are. Let be a cycle such that the line segments belong to, say, for odd and for even (where ). Such a cycle exists as every vertex of the polygon is an endpoint of at least one line segment in and one in . Since and are intersecting, all intersect for odd and for even. Therefore all with even lie on or the opposite side of with respect to and all with odd lie on or the opposite side of with respect to . In particular, is odd and is a vertex of . Then lies on or the opposite side of with respect to , and lies on or the opposite side of with respect to . Let be a line segment belonging to . Since must intersect both and , which belong to , must lie between and on the polygon. But then also belongs to and hence to , a contradiction.
Finally, if , , , , are five consecutive vertices on the polygon, then consists of line segments.
Next we will show that if and are intersecting sets with , then and cannot be disjoint. Assume they are. Let be a cycle such that the line segments belong to, say, for odd and for even (where ). Such a cycle exists as every vertex of the polygon is an endpoint of at least one line segment in and one in . Since and are intersecting, all intersect for odd and for even. Therefore all with even lie on or the opposite side of with respect to and all with odd lie on or the opposite side of with respect to . In particular, is odd and is a vertex of . Then lies on or the opposite side of with respect to , and lies on or the opposite side of with respect to . Let be a line segment belonging to . Since must intersect both and , which belong to , must lie between and on the polygon. But then also belongs to and hence to , a contradiction.
Finally, if , , , , are five consecutive vertices on the polygon, then consists of line segments.
Final answer
4019
Techniques
Convex hullsAngle chasingConstructions and lociColoring schemes, extremal arguments