Determine the largest integer n≥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. graph theoryArithmetic ProgressionRMM Shortlistcombinatoricsarithmetic sequencealgebra