Crossing Numbers and Hard Erdos Problems in Discrete Geometry

Combinatorics Probability and Computing

Volumn 6, Issue 3, 1997, Pages 353-358

  Székely, László A ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346660395     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397002976     Document Type: Article

References (26)

1. Ajtai, M., Chvátal, V., Newborn, M. and Szemerédi, E. (1982) Crossing-free subgraphs. Ann. Discrete Math. 12 9-12.
2. Beck, J. (1983) On the lattice property of the plane and some problems of Dirac, Motzkin, and Erdos in combinatorial geometry. Combinatorica 3 281-297.
3. Beck, J. Different distances. Preprint.
4. Beck, J. and Spencer, J. (1984) Unit distances. J. Combinatorial Theory A 37 231-238.
5. Chung, F. R. K. (1992) On the number of different distances determined by n points in the plane. J. Combinatorial Theory A 36 342-354.
6. Clarkson, K., Edelsbrunner, H., Guibas, L., Sharir, M. and Welzl, E. (1990) Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comp. Geometry 5 99-160.
7. Chung, F. R. K., Szemerédi, E. and Trotter, W. T. (1992) The number of different distances determined by a set of points in the Euclidean plane. Discrete Comp. Geometry 7 1-11.
8. Erdos, P. (1946) On sets of distances of n points. Amer. Math. Monthly 53 248-250.
9. Erdos, P. Problems and results in combinatorial geometry. Proc. New York Acad. Sci.
10. Erdos, P. and Guy, R. K. (1973) Crossing number problems. Am. Math. Monthly 80 52-58.
11. Füredi, Z. and Pach, J. (1995) Traces of finite sets: extremal problems and geometric applications. In Extremal Problems for Finite Sets, Visegrád, 1991: Bolyai Society Mathematical Studies 3 Bolyai Society, Budapest, 239-270.
12. Guy, R. K. (1972) Crossing numbers of graphs. In Graph Theory and its Applications. Lecture Notes in Mathematics 303 Springer Verlag, 111-124.
13. Józsa, S. and Szemerédi, E. (1973) The number of unit distances on the plane. In Infinite and Finite Sets: Coll. Math. Soc. J. Bolyai 10 939-950.
14. p,q and Q(d). J. Combinatorial Theory (B) 12 287-298.
15. Kainen, P. C. and White, A. T. (1978) On stable crossing numbers. J. Graph Theory 2 181-187.
16. Leighton, F. T. (1983) Complexity Issues in VLSI. MIT Press.
17. Moser, L. (1952) On the different distances determined by n points. Am. Math. Monthly 59 85-91.
18. Pach, J. and Agarwal, P. K. (1995) Combinatorial Geometry. Wiley.
19. Pach, J. and Sharir, M. (1992) Repeated angles in the plane and related problems. J. Combinatorial Theory A 59 12-22.
20. Székely, L. A. (1987) Inclusion-exclusion formulae without higher terms. Ars Combinatoria 23B 7-20.
21. Shahrokhi, F., Sýkora, O., Székely, L. A. and Vrťo, I. (1994) Improved bounds for the crossing numbers on surfaces of genus g. In J. van Leeuwen (ed), Graph-Theoretic Concepts in Computer Science. Proc. 19th Int. Workshop WG'93. Lecture Notes in Computer Science 790 Springer-Verlag, 388-395. (Also see: (1996) Drawings of graphs on surfaces with few crossings. Algorithmica 16 118-131.)
22. Shahrokhi, F., Sýkora, O., Székely, L. A. and Vrťo, I. (1994) Improved bounds for the crossing numbers on surfaces of genus g. In J. van Leeuwen (ed), Graph-Theoretic Concepts in Computer Science. Proc. 19th Int. Workshop WG'93. Lecture Notes in Computer Science 790 Springer-Verlag, 388-395. (Also see: (1996) Drawings of graphs on surfaces with few crossings. Algorithmica 16 118-131.)
23. Shahrokhi, F., Székely, L. A. and Vrťo, I. (1995) Crossing numbers of graphs, lower bound techniques and algorithms: a survey. Proc. Graph Drawing '94, Princeton, NJ. Lecture Notes in Computer Science 894 Springer-Verlag, 131-142.
24. Spencer, J., Szemerédi, E. and Trotter, W. T. (1984) Unit distances in the Euclidean plane. In B. Bollobás (ed), Graph Theory and Combinatorics Academic Press, 293-308.
25. Szemerédi, E. and Trotter, W. T. (1983) Extremal problems in discrete geometry Combinatorica 3 381-392.
26. Szemerédi, E. and Trotter, W. T. (1983) A combinatorial distinction between the Euclidean and projective planes. Euro. J. Combinatorics 4 385-394.