On the rectilinear crossing number of complete graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 583-588

  Wagner, Uli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; NUMBER THEORY; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

COMPLETE GRAPHS; RECTILINEAR CROSSING NUMBER;

GRAPH THEORY;

EID: 0038077474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Oswin Aichholzer, Franz Aurenhammer, and Hans Krasser. On the crossing number of complete graphs. In Proc. 18th Ann. ACM Symp. Comp. Geom., Barcelona, Spain, pages 19-24, 2002.
2. n: New Drawings, Upper Bounds, and Asymptotics. Discrete Math., to appear, 2000.
3. 10 is 62. Electron. J. Combin., 8(1): Research Paper 23, 30 pp. (electronic), 2001.
4. Paul Erdös and Richard P. Guy. Crossing number problems. American Mathematical Monthly, 80:52-58, 1973.
5. H. F. Jensen. An upper bound for the rectilinear crossing number of the complete graph. J. Combinatorial Theory Ser. B, 10:212-216, 1971.
6. Jiří Matoušek. Lectures on discrete geometry. Springer-Verlag, New York, N.Y., 2002.
7. Imrich Vrt'o. Crossing numbers of graphs: A bibliography. http://www.ifi.savba.sk/~imrich.
8. János Pach and Géza Tóth. Thirteen problems on crossing numbers. Geombinatorics, 9(4):194-207, 2000.
9. David Singer. Rectilinear crossing numbers. Manuscript, 1971.
10. Uli Wagner and Emo Welzl. A continuous analogue of the upper bound theorem. Discrete Comput. Geom., 26(2):205-219, 2001.
11. Emo Welzl. Entering and leaving j-facets. Discrete Comput. Geom., 25(3):351-364, 2001.