MathDB
Graph with even cycles

Source: Balkan MO 2002, problem 1

April 24, 2006
inductioncombinatorics proposedcombinatorics

Problem Statement

Consider nn points A1,A2,A3,,AnA_1,A_2,A_3,\ldots, A_n (n4n\geq 4) in the plane, such that any three are not collinear. Some pairs of distinct points among A1,A2,A3,,AnA_1,A_2,A_3,\ldots, A_n are connected by segments, such that every point is connected with at least three different points. Prove that there exists k>1k>1 and the distinct points X1,X2,,X2kX_1,X_2,\ldots, X_{2k} in the set {A1,A2,A3,,An}\{A_1,A_2,A_3,\ldots, A_n\}, such that for every i1,2k1i\in \overline{1,2k-1} the point XiX_i is connected with Xi+1X_{i+1}, and X2kX_{2k} is connected with X1X_1.