Crossing Numbers of Random Graphs

Random Structures and Algorithms

Volumn 21, Issue 3-4, 2002, Pages 347-358

  Spencer, Joel ^a   Tóth, Géza ^b,c  

^a NEW YORK UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242330697     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10053     Document Type: Conference Paper

References (20)

1. O. Aichholzer, F. Aurenhammer, and H. Krasser, Progress on rectilinear crossing numbers, manuscript.
2. N. Alon, The number of polytopes, configurations, and real matroids, Mathematika 33 (1986), 62-71.
3. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Isr J Math 100 (1997), 171-187.
4. N. Alon and J. Spencer, The probabilistic method, Wiley, New York, 1992.
5. K. Azuma, Weighted sums of certain dependent random variables, Tohoku Math J 19(2) (1967), 357-367.
6. D. Bienstock and N. Dean, Bounds for rectilinear crossing numbers, J Graph Theory 17 (1993), 333-348.
7. n: New drawings, upper bounds and applications, submitted.
8. d, Discrete Comput Geom 1 (1986), 219-227.
9. J. Goodman and R. Pollack, New bounds on higher dimensional configurations and polytopes, Ann NY Acad Sci 555 (1989), 205-212.
10. R. K. Guy, Crossing numbers of graphs, Graph Theory Applications (Proc Conf Western Michigan Univ, Kalamazoo, 1972), Lecture Notes in Mathematics 303, Springer-Verlag, Berlin, 1972, pp. 111-124.
11. J. H. Kim and V. H. Vu, Concentration of multivariate polynomials and its applications, Combinatorica 20 (2000), 417-434.
12. F. T. Leighton, New lower bound techniques for VLSI, Math Syst Theory 17 (1984), 47-70.
13. R. Lipton and R. Tarjan, A separator theorem for planar graphs, SIAM J Appl Math 36 (1979), 177-189.
14. M. Łuczak and C. McDiarmid, Bisecting sparse random graphs, Random Struct Alg 18 (2001), 31-38.
15. J. Pach, F. Shahrokhi, and M. Szegedy, Applications of the crossing number, Algorithmica 16 (1996), 111-117.
16. J. Pach and G. Tóth, Thirteen problems on crossing numbers, Geombinatorics 9 (2000), 194-207.
17. J. Pach and G. Tóth, Which crossing number is it, anyway?, Proc 39th Annu Symp Foundations of Computer Science, IEEE Press, New York, 1998, pp. 617-626; also J Combinat Theory Ser B 80 (2000), 225-246.
18. J. Pach and G. Tóth, Which crossing number is it, anyway?, Proc 39th Annu Symp Foundations of Computer Science, IEEE Press, New York, 1998, pp. 617-626; also J Combinat Theory Ser B 80 (2000), 225-246.
19. R. B. Richter and C. Thomassen, Relations between crossing numbers of complete and complete bipartite graphs, Am Math Mon 104 (February 1997), 131-137.
20. J. Spencer, Counting Extensions, J Combinat Theory Ser A 55 (1990), 247-255.