Improving the Crossing Lemma by finding more crossings in sparse graphs

Discrete and Computational Geometry

Volumn 36, Issue 4, 2006, Pages 527-552

  Pach, Janos ^a,b   Radoicic, Rados ^c   Tardos, Gabor ^b   Toth, Geza ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750346859     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1264-9     Document Type: Conference Paper

References (20)

1. +] M. Ajtai, V. Chvátal, M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Annuals of Discrete Mathematics 12 (1982), 9-12.
2. +] K. Clarkson, H. Edelsbrunner, L. Guibas, M. Shark, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete & Computational Geometry 5 (1990), 99-160.
3. +] É Czabarka, O. Sýkora, L. Székely, and I. Vrt'o, Biplanar crossing numbers, I: a survey of results and problems, in: More Sets, Graphs and Numbers, pp. 57-77, Bolyai Society Mathematical Studies, 15, Springer, Berlin, 2006.
4. [D] T. K. Dey, Improved bounds for planar k-sets and related problems, Discrete & Computational Geometry 19 (1998), 373-382.
5. [ENR] G. Elekes, M. Nathanson, and I. Z. Ruzsa, Convexity and sumsets, Journal of Number Theory 83 (2000), 194-201.
6. [ErG] P. Erdõs and R. K. Guy, Crossing number problems, American Mathematical Monthly 80 (1973), 52-58.
7. [KT] N. H. Katz and G. Tardos, A new entropy inequality for the Erdõs distance problem, in: Towards a Theory of Geometric Graphs (J. Fach, ed.), pp. 119-126, Contemporary Mathematics, 342, American Mathematical Society, Providence, RI, 2004.
8. [L] T. Leighton, Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA, 1983.
9. [PI] J. Pach, Geometric graph theory, in: Surveys in Combinatorics, 1999 (J. D. Lamb and D. A. Preece, eds.), pp. 167-200, London Mathemetical Society Lecture Notes 267, Cambridge University Press, Cambridge, 1999.
10. [P2] J. Pach, Geometric graph theory, in: Handbook of Discrete and Computational Geometry, 2nd edn. (J. E. Goodman et al., eds.), pp. 219-238, CRC Press, Boca Raton, FL, 2004.
11. [PS] J. Fach and M. Shark, On the number of incidences between points and curves, Combinatorics, Probability, and Computing 1 (1998), 121-127.
12. [PST] J. Pach, J. Spencer, and G. Tóth, New bounds on crossing numbers, Discrete & Computational Geometry 24 (2000), 623-644.
13. [PTa] J. Pach and G. Tardos, Isosceles triangles determined by a planar point set, Graphs and Combinatorics 18 (2002), 769-779.
14. [PTo1] J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.
15. [PTo2] J. Pach and G. Tóth, Which crossing number is it, anyway? Journal of Combinatorial Theory, Series B 80 (2000), 225-246.
16. [PSS] M. J. Pelsmajer, M. Schaefer, and D. Štefankovič, Odd crossing number is not crossing number, manuscript, 2005.
17. [ST] J. Solymosi and Cs. Tóth, Distinct distances in the plane, Discrete & Computational Geometry 25 (2001), 629-634.
18. [STT] J. Solymosi, G. Tardos, and Cs. Tóth, The k most frequent distances in the plane, Discrete & Computational Geometry 28 (2002), 769-779.
19. [Sz] L. Székely, Crossing numbers and hard Erdos problems in discrete geometry, Combinatorics, Probability, and Computing 6 (1997), 353-358.
20. [SzT] E. Szemerédi and W. T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.