olymmath

BALTIC-WAY 2016 Problem 15

    The Baltic Sea has 2016 harbours. There are two-way ferry connections between some of them. It is impossible to make a sequence of direct voyages C1−C2−⋯−C1062C_{1}-C_{2}-\cdots-C_{1062} where all the harbours C1,…,C1062C_{1}, \ldots, C_{1062} are distinct. Prove that there exist two disjoint sets AA and BB of 477 harbours each, such that there is no harbour in AA with a direct ferry connection to a harbour in BB.

    Dataset text NuminaMath olympiads. 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

    Locator baltic-way/2016/p15 · Tag GA098CSM8S · Edit this page on GitHub · Keys: j next, k previous