A Bipartite Strengthening of the Crossing Lemma
From MaRDI portal
Publication:5452205
DOI10.1007/978-3-540-77537-9_4zbMath1137.68486OpenAlexW2614087704MaRDI QIDQ5452205
János Pach, Jacob Fox, Csaba D. Tóth
Publication date: 25 March 2008
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_4
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán-type results for partial orders and intersection graphs of convex sets
- Extremal problems in discrete geometry
- Improving the crossing lemma by finding more crossings in sparse graphs
- A bipartite analogue of Dilworth's theorem
- Ramanujan graphs
- Comparability graphs and intersection graphs
- Improved bounds for planar \(k\)-sets and related problems
- Convexity and sumsets
- New bounds on crossing numbers
- Which crossing number is it anyway?
- The \(k\) most frequent distances in the plane
- Isosceles triangles determined by a planar point set
- Crossing number, pair-crossing number, and expansion
- Applications of the crossing number
- A Separator Theorem for Planar Graphs
- New lower bound techniques for VLSI
- Crossing-Free Subgraphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On the Number of Incidences Between Points and Curves
- Intersection patterns of curves
- On Sets of Distances of n Points
- Distinct distances in the plane
- Crossing patterns of segments
