Graph triangles with arithmetic progressions
Source: RMM Extralist 2021 C1
September 18, 2023
graph theoryArithmetic ProgressionRMM Shortlistcombinatoricsarithmetic sequencealgebra
Problem Statement
Determine the largest integer for which the edges of the complete graph on vertices
can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.