Graph with even cycles
Source: Balkan MO 2002, problem 1
April 24, 2006
inductioncombinatorics proposedcombinatorics
Problem Statement
Consider points () in the plane, such that any three are not collinear. Some pairs of distinct points among are connected by segments, such that every point is connected with at least three different points. Prove that there exists and the distinct points in the set , such that for every the point is connected with , and is connected with .