olymmath

BG-MO 2018 Problem 6

    On a planet there are MM countries and NN cities. There are two-way roads between some of the cities. It is given that:

    (1) In each county there are at least three cities;

    (2) For each country and each city in the country is connected by roads with at least half of the other cities in the countries;

    (3) Each city is connceted with exactly one other city ,that is not in its country;

    (4) There are at most two roads between cities from cities in two different countries;

    (5) If two countries contain less than 2M2M cities in total then there is a road between them.

    Prove that there is cycle of lenght at least M+N2M+\frac{N}{2} .

    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 bg-mo/2018/p6 · Tag GSFR5DYNZ8 · Edit this page on GitHub · Keys: j next, k previous