CGMO 2012 ( China Girls Math Olympiad 2012) Problem 6


There are n cities, 2 airline companies in a country. Between any two cities, there is exactly one 2-way flight connecting them which is operated by one of the two companies. A female mathematician plans a travel route, so that it starts and ends at the same city, passes through at least two other cities, and each city in the route is visited once. She finds out that wherever she starts and whatever route she chooses, she must take flights of both companies. Find the maximum value of  n

Advertisements

About shivang1729

I am a young student who loves math . I like number theory and inequalities part the most , and preparing for Math Olympiads :)

Posted on Saturday,August 18, 2012, in Problems and tagged , . Bookmark the permalink. Leave a comment.

Comments / doubts/answers here:

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: