User blog comment:Hyp cos/Googolisms hard to extend?/@comment-32213734-20190420023527/@comment-32213734-20190420045344

It is said:
 * Let N* be the smallest dimension n of a hypercube such that if the lines joining all pairs of corners are two-colored for any n ≥ N*, a complete graph K4 of one color with coplanar vertices will be forced. Find N*.

If we remove "the smallest", then, because of "any n ≥ N*", all N* + 1, N* + 2, ... also are solutions, so it is not a "special" extension. (But N* is unknown, and it may turn out that N* is not very large).