If the largest size of a subset of {1,2,3}^n without a combinatorial line is 3^n/d(n), then (poll 1490079)

If the largest size of a subset of {1,2,3}^n without a combinatorial line is 3^n/d(n), then

d(n) behaves like log*(n)

d(n) is larger than log log log...log n where the log is taken k times

The truth is near the hyper optimistic conjecture

Other:

Vote View Results

See this poll on: https://poll.fm/1490079/embed