Using results from extremal graph theory, we determine the asymptotic number of string graphs with n vertices, i.e., graphs that can be obtained as the intersection graph of a system of continuous arcs in the plane. The number becomes much smaller, for any fixed d, if we restrict our attention to systems of arcs, any two of which cross at most d times. As an application, we estimate the number of different drawings of the complete graph K n with n vertices under various side conditions.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Miklós Simonovits on his sixtieth birthday
* Supported by NSF grant CR-00-98246, PSC-CUNY Research Award 62450-0031 and OTKA-T-032452.
† Supported by OTKA-T-032452 and OTKA-T-038397.