Is it true that, for all sufficiently large $n$ , if $G$ is a triangle-free graph on ${1, \dots, n}$ then there must exist three independent points $a, b, a + b$ ?

Worked, still open.

additive combinatorics · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

solved