String graphs requiring exponential representations (Q1121918)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4105014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | String graphs requiring exponential representations |
scientific article; zbMATH DE number 4105014 |
Statements
String graphs requiring exponential representations (English)
0 references
1991
0 references
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.
0 references
intersection graph
0 references
curves
0 references
0 references
0.8081426620483398
0 references
0.8077468872070312
0 references
0.8026959896087646
0 references
