If Sidon sets $A, B \subseteq \{1, \dots, N\}$ satisfy $(A-A) \cap (B-B) = \{0\}$, must $\binom{|A|}{2} + \binom{|B|}{2} \le \binom{f(N)}{2} + O(1)$, where $f(N)$ is the largest Sidon-set size in $[N]$ - and can the bound be improved by a fixed proportion when $|A| = |B|$?

How a contribution reaches this record

Seven steps, in four places.

1. 1

   Read the sources and their formal declarations.

   Public
2. 2

   Work on it, wherever you work.

   Your machine
3. 3

   Keep an Approach and its Attempts here.

   Needs an account
4. 4

   Attach evidence by its content root.

   Needs an account
5. 5

   Prepare an unsigned Submission draft.

   Needs an account
6. 6

   Sign it with your own key.

   Your machine
7. 7

   The Repository decides.

   The Repository