String graphs have the Erdős-Hajnal property

DOI10.4171/JEMS/1362OpenAlexW4380301656MaRDI QIDQ6192228

István Tomon

Publication date: 11 March 2024

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/jems/1362

zbMATH Keywords

Ramsey theorystring graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type constructions for arrangements of segments
• Ramsey-type theorems
• A bipartite analogue of Dilworth's theorem
• Separator theorems and Turán-type results for planar intersection graphs
• String graphs requiring exponential representations
• Comparability graphs and intersection graphs
• Pure pairs. II: Excluding all subdivisions of a graph
• A sharp threshold phenomenon in string graphs
• Crossing patterns of semi-algebraic sets
• The Erdös-Hajnal Conjecture-A Survey
• A Separator Theorem for String Graphs and its Applications
• A Ramsey-Type Result for Convex Sets
• 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
• Some remarks on the theory of graphs
• String graphs and incomparability graphs
• Crossing patterns of segments

This page was built for publication: String graphs have the Erdős-Hajnal property