A bipartite strengthening of the crossing Lemma
From MaRDI portal
Publication:968451
DOI10.1016/j.jctb.2009.03.005zbMath1214.05011OpenAlexW1964330956MaRDI QIDQ968451
Jacob Fox, Csaba D. Tóth, János Pach
Publication date: 5 May 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/129375
Related Items
Clique-based separators for geometric intersection graphs, String graphs and incomparability graphs, On grids in topological graphs, Applications of a New Separator Theorem for String Graphs, Optimality program in segment and string graphs, Separators in region intersection graphs
Cites Work
- 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
- Topological graphs with no large grids
- 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
- On Sets of Distances of n Points
- String graphs and incomparability graphs
- Distinct distances in the plane
- Crossing patterns of segments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
