String graphs requiring exponential representations (Q1121918)

From MaRDI portal
Revision as of 14:42, 19 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers