Problem

Source: Ukrainian Mathematical Olympiad 2023. Day 2, Problem 9.8

Tags: combinatorics, graphs



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