2000 character limit reached
The Clique Problem in Ray Intersection Graphs
Published 25 Nov 2011 in cs.CG and cs.CC | (1111.5986v1)
Abstract: Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and implies that finding a maximum clique in a segment intersection graph is NP-hard. This solves a 21-year old open problem posed by Kratochv\'il and Ne\v{s}et\v{r}il.
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.