On the crossing number of complete graphs

Computing (Vienna/New York)

Volumn 76, Issue 1-2, 2006, Pages 165-176

  Aichholzer, O ^a,b   Aurenhammer, F ^a,c   Krasser, H ^a,c  

^a Institute for Software Technology ^*

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complete graph; Crossing number; Enumeration; Order types

Indexed keywords

COMPLETE GRAPHS; CROSSING NUMBER; ENUMERATION; ORDER TYPES;

NUMBER THEORY; SET THEORY;

GRAPH THEORY;

EID: 27644564296     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-005-0133-3     Document Type: Article

References (29)

1. Ábrego, B., Fernández-Merchant, S.: A lower bound for the rectilinear crossing number. Graphs and Combinatorics (to appear).
2. Aichholzer, O., Aurenhammer, F., Krasser, H.: Enumerating order types for small point sets with applications. Order 19, 265-281 (2002).
3. Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. Proc. 18th Ann. ACM Symp. Comput. Geometry, Barcelona, Spain, 2002, pp. 19-24.
4. Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. Proc. 13th Ann. Canadian Conf. Comput. Geometry CCCG 2001, Waterloo, Canada, 2001, pp. 17-20.
5. Aichholzer, O., Krasser, H.: Abstract order type extension and new results on the rectilinear crossing number. Proc. 21th Ann. ACM Symp. Computational Geometry 2005, Pisa, Italy, pp. 91-98.
6. n. (submitted).
7. Bienstock, D.: Some provably hard crossing number problems. Discrete Comput. Geometry 6, 443-459 (1991).
8. 10 is 62. The Electronic J. Combinatorics 8, Research Paper 23 (2001).
9. n: new drawings, upper bounds, and asymptotics. Discrete Math. 262, 59-77 (2003).
10. Erdös, P., Guy, R. K.: Crossing number problems. Am. Math. Month. 88, 52-58 (1973).
11. Garey, R. K., Johnson D.S.: Crossing number is NP-complete. SIAM J. Alg. Disc. Meth. 4, 312-316 (1983).
12. Goodman, J. E., Pollack, R.: Multi-dimensional sorting. SIAM J. Comput. 12, 484-507 (1983).
13. Guy, R.K.: A combinatorial problem. Nabla (Bull. Malayan Math. Soc.) 7, 68-72 (1960).
14. Harary, F., Hill, A.: On the number of crossings in a complete graph. Proc. Edinburgh Math. Soc. 13(2), 333-338 (1962).
15. Hayward, R. B.: A lower bound for the optimal crossing-free Hamiltonian cycle problem. Discrete Comput. Geometry 2, 327-343 (1987).
16. Jensen, H. F.: An upper bound for the rectilinear crossing number of the complete graph. J. Combinatorial Theory B 29, 212-216 (1971).
17. Leighton, F. T.: Complexity issues in VLSI. Cambridge: The MIT Press 1983.
18. Lovász, L., Vesztergombi, K., Welzl, E., Wagner, U.: Convex quadrilaterals and k-sets. In: Towards a theory of geometric graphs (Pach J., ed.). AMS Contemporary Mathematics Ser. 342, 139-148 (2004).
19. Pach, J., Tóth, G.: Which crossing number is it, anyway? J. Combinatorial Theor. B 80, 225-246 (2000).
20. Pach, J., Tóth, G.: Thirteen problems on crossing numbers. Geombinatorics 9, 195-207 (2000).
21. Richter, R.B., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs. Am. Math. Month. 104, 131-137 (1997).
22. Scheinerman, E.R., Wilf, H.S.: The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability. Am. Math. Month. 101, 939-943 (1994).
23. Singer, D.: The rectilinear crossing number of certain graphs. Manuscript, 1971. Available at: http://www.cwru.edu/artsci/math/singer/
24. Thorpe, J. T., Harris, F. C.: A parallel stochastic optimization algorithm for finding mappings of the rectilinear minimal crossing number. Ars Combinatorica 43, 135-148 (1996).
25. Tutte, W. T.: Toward a theory of crossing numbers. J. Combinatorial Theor. 8, 45-53 (1970).
26. Wagner, U.: On the rectilinear crossing number of complete craphs. Proc. 14th Ann. Symp. on Discrete Algorithms (SODA), 2003, pp. 583-588.
27. Wilf, H. S.: On crossing numbers, and some unsolved problems. In: Combinatorics, geometry, and probability. Cambridge: Cambridge University Press 1997, pp. 557-562.
28. http://www.ist.tugraz.at/aichholzer/crossings.html
29. http://www.igi.tugraz.at/hkrasser/data/d36.nb