15. Unavoidable crossing quaduples
-
Unavoidable crossing quaduples
Let $f(n)$ be the smallest number $N$ such that any drawing of $K_N$ in the plane contains $n$ vertices with every four of them inducing a crossing.Problem 15.1.
[Cosmin Pohoata] Is it true that $f(n) \leq 2^{O(n)}$
Cite this as: AimPL: Albertson conjecture and related problems, available at http://aimpl.org/albertson.