An exponential bound for simultaneous embeddings of planar graphs

05/25/2023

∙

by   Ritesh Goenka, et al.

∙

0

∙

share

We show that there are O(n · 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.