Homothetic Polygons and Beyond: Intersection Graphs, Recognition, and Maximum Clique

Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer +5

We study the {\sc Clique} problem in classes of intersection graphs of convex sets in the plane. The problem is known to be NP-complete in convex-set intersection graphs and straig…