H-convex all-edges-crossed conjecture

An h-convex drawing of $K_n$ is a drawing in which the vertices are in convex position with respect to the relevant hull structure. H-convex all-edges-crossed conjecture. For $n\geq 11$ there is an h-convex drawing of $K_n$ where every edge is crossed. Examples are known for $11\leq n\leq 21$, while the general assertion remains open; the paper reports that the computation for $n=22$ timed out.