2000 character limit reached
An exponential bound for simultaneous embeddings of planar graphs
Published 25 May 2023 in math.CO, cs.CG, and cs.DM | (2305.15721v1)
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.