olymmath

KöMaL 2015 B4733

    Every edge of a simple connected graph of n≥2n\ge 2 vertices is labelled with either a 1 or with a 2. Then each vertex is assigned with the product of the numbers on the edges product of the numbers on the related edges on it. Show that there will be a pair of two vertices assigned with the same number.

    Official text KöMaL. 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 hu-komal/2015/b4733 · Tag FG74NAWX77 · Edit this page on GitHub · Keys: j next, k previous