olymmath

IL-GILLIS 1995 Problem 7

    For certain nn countries there is an airline connecting any two countries, but some of the airlines are closed. Show that if the number of the closed airlines does not exceed n−3n-3 , then one can make a round trip using the remaining airlines, starting from one of the countries, visiting every country exactly once and returning to the starting country.

    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 il-gillis/1995/p7 · Tag 7T514X71MG · Edit this page on GitHub · Keys: j next, k previous