olymmath

KöMaL 2006 B3949

    For what values of the positive integer nn is there a simple graph in which the degree of each vertex is at most nn, and there are ii vertices of degree ii for all 1≤i≤n\le i \le n? (Suggested by G. Mészáros, Kemence)

    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/2006/b3949 · Tag G1RJ70ECKY · Edit this page on GitHub · Keys: j next, k previous