We show that there are $O(n \cdot 4^{n/11})$ planar graphs on $n$ vertices which do not admit a simultaneous straight-line embedding on any $n$-point set in the plane. In particular, this improves the best known bound $O(n!)$ significantly.

翻译：我们证明存在 $O(n \cdot 4^{n/11})$ 个具有 $n$ 个顶点的平面图，它们在平面上任何 $n$ 点集上都不允许同步直线嵌入。特别地，这显著改进了已知的最佳上界 $O(n!)$。