String graphs requiring exponential representations
We provide a construction of a graph on O(n) vertices which can be represented as the intersection graph of a system of curves in the plane, but every such representation contains at least \(2^ n\) intersecting points of the curves.
scientific article; zbMATH DE number 4105014