String graphs requiring exponential representations (Q1121918): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Intersection graphs of curves in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Energy, central charge, and the BPS bound for \(1+1\)-dimensional supersymmetric solitons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: String graphs. II: Recognizing string graphs is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Topology of Thin Film RC Circuits / rank | |||
Normal rank | |||
Latest revision as of 14:42, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | String graphs requiring exponential representations |
scientific article |
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
