olymmath

RU-SPB 2009 Problem 116

  • Grade 11

Some cities in country are connected by road, and from every city goes ≥2008\geq 2008 roads. Every road is colored in one of two colors. Prove, that exists cycle without self-intersections ,where ≥504\geq 504 roads and all roads are same color.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator ru-spb/2009/p116 · Tag KDBTND316H · Edit this page on GitHub · Keys: j next, k previous