2000 character limit reached
RAC-drawability is $\exists\mathbb{R}$-complete
Published 24 Jul 2021 in math.CO and cs.CC | (2107.11663v2)
Abstract: A RAC-drawing of a graph is a straight-line drawing in which every crossing occurs at a right-angle. We show that deciding whether a graph has a RAC-drawing is as hard as the existential theory of the reals, even if we know that every edge is involved in at most ten crossings and even if the drawing is specified up to isomorphism.
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.
