Problem

Source: RMM Extralist 2021 C1

Tags: graph theory, Arithmetic Progression, RMM Shortlist, combinatorics, arithmetic sequence, algebra



Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.