olymmath

UA-UMO 2023 Problem 98

    What is the largest possible number of edges in a graph on 2n2n nodes, if there exists exactly one way to split its nodes into nn pairs so that the nodes from each pair are connected by an edge?

    Proposed by Anton Trygub

    Dataset text AI-MO AoPS. 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 ua-umo/2023/p98 · Tag H9HVDQG84M · Edit this page on GitHub · Keys: j next, k previous