Ordered graphs and large bi-cliques in intersection graphs of curves

DOI10.1016/j.ejc.2019.07.005zbMath1419.05065arXiv1902.09810OpenAlexW2966128754MaRDI QIDQ2323249

István Tomon, János Pach

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

monotone curves

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (4)

Erdős-Hajnal-type results for monotone paths ⋮ A sharp threshold phenomenon in string graphs ⋮ On the chromatic number of disjointness graphs of curves ⋮ Pure Pairs VI: Excluding an Ordered Tree

Cites Work

• Turán-type results for partial orders and intersection graphs of convex sets
• Ramsey-type theorems
• Supersaturated graphs and hypergraphs
• A bipartite analogue of Dilworth's theorem
• How many ways can one draw a graph?
• A bipartite analogue of Dilworth's theorem for multiple partial orders
• On universality of graphs with uniformly distributed edges
• Circle orders, n-gon orders and the crossing number
• The Erdős-Hajnal conjecture for paths and antipaths
• Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs
• The Erdös-Hajnal Conjecture-A Survey
• Separators in region intersection graphs
• A Ramsey-Type Theorem for Orderings of a Graph
• Almost all string graphs are intersection graphs of plane convex sets
• String graphs and incomparability graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordered graphs and large bi-cliques in intersection graphs of curves