olymmath

KöMaL 2024 A870

    We label every edge of a simple graph with the difference of the degrees of its endpoints. If the number of vertices is NN, what can be the largest value of the sum of the labels on the edges?

    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/2024/a870 · Tag RJ0PZJQJ2H · Edit this page on GitHub · Keys: j next, k previous