olymmath

KöMaL 2008 B4052

    A path P1P_1,P2P_2,...,PkP_k in a simple graph is said to be a fan if the degree of every point PiP_i is ii. What is the maximum number of points that a fan may have in a simple graph on nn points?

    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/2008/b4052 · Tag VZ5J12JNRZ · Edit this page on GitHub · Keys: j next, k previous