A sharp threshold phenomenon in string graphs

DOI10.1007/s00454-021-00279-3zbMath1480.05038arXiv1908.05550OpenAlexW3134496828MaRDI QIDQ2066317

István Tomon

Publication date: 14 January 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.05550

zbMATH Keywords

separatorstring graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

String graphs have the Erdős-Hajnal property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán-type results for partial orders and intersection graphs of convex sets
• A bipartite analogue of Dilworth's theorem
• How many ways can one draw a graph?
• Almost all string graphs are intersection graphs of plane convex sets
• Pure pairs. I: Trees and linear anticomplete pairs
• Ordered graphs and large bi-cliques in intersection graphs of curves
• A Separator Theorem for String Graphs and its Applications
• A Separator Theorem for Planar Graphs
• Separators in region intersection graphs
• Intersection patterns of curves
• Applications of a New Separator Theorem for String Graphs
• Near-Optimal Separators in String Graphs
• Topology of Thin Film RC Circuits
• Toward a theory of crossing numbers
• String graphs and incomparability graphs

This page was built for publication: A sharp threshold phenomenon in string graphs