Erdős's conjecture on equilateral triangles in six dimensions

Let T6(n)T_6(n) denote the maximum number of equilateral triangles determined by a set of nn points in R6\mathbb{R}^6. Erdős's conjecture. Any set of nn points in R6\mathbb{R}^6 can span at most

n3/27+o(n3)n^3/27+o(n^3)

equilateral triangles, i.e., T6(n)n3/27+o(n3)T_6(n)\leq n^3/27+o(n^3). Erdős and Purdy proved the matching lower bound T6(n)n3/27O(n2)T_6(n)\geq n^3/27-O(n^2), so the conjecture would determine the asymptotic maximum. Its resolution remains open.

Sources & referencesView supporting material

Primary source

Felix Christian Clemen, Adrian Dumitrescu and Dingyuan Liu, “The number of regular simplices in higher dimensions”, arXiv:2507.19841 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.