A Bipartite Strengthening of the Crossing Lemma
DOI10.1007/978-3-540-77537-9_4zbMATH Open1137.68486OpenAlexW2614087704MaRDI QIDQ5452205FDOQ5452205
Authors: Jacob Fox, János Pach, 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
Recommendations
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
- Additive combinatorics
- Comparability graphs and intersection graphs
- Convexity and sumsets
- A bipartite analogue of Dilworth's theorem
- Ramanujan graphs
- A Separator Theorem for Planar Graphs
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- On the Number of Incidences Between Points and Curves
- On Sets of Distances of n Points
- Extremal problems in discrete geometry
- Improving the crossing lemma by finding more crossings in sparse graphs
- Improved bounds for planar \(k\)-sets and related problems
- Crossing-Free Subgraphs
- Isosceles triangles determined by a planar point set
- Title not available (Why is that?)
- Crossing number, pair-crossing number, and expansion
- Applications of the crossing number
- New lower bound techniques for VLSI
- Intersection patterns of curves
- Title not available (Why is that?)
- Turán-type results for partial orders and intersection graphs of convex sets
- Distinct distances in the plane
- Which crossing number is it anyway?
- Crossing patterns of segments
- New bounds on crossing numbers
- Title not available (Why is that?)
- The \(k\) most frequent distances in the plane
Cited In (4)
This page was built for publication: A Bipartite Strengthening of the Crossing Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452205)
