olymmath

FI-MO 2016 Problem 5

    The ruler of Laputa will set up a train network between cities in the state, which satisfies the following conditions:

    • Uniformity: From one city to another, by train, possibly through exchanges.
    • Prohibition N: There exist no four cities A,B,C,DA, B, C, D such that there are direct routes between AA and B,BB, B and CC , and CC and DD , but taking a shortcut is not possible, that is, there are no direct rout between AA and C,BC, B and DD , or AA and DD . In addition, a direct airliner connection will be established exactly between their city pairs, with no direct train connection. Prove that the airline network is not connected when there is more than one city.

    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 fi-mo/2016/p5 · Tag B118DRNMN3 · Edit this page on GitHub · Keys: j next, k previous