An improvement of the crossing number bound

Journal of Graph Theory

Volumn 50, Issue 1, 2005, Pages 43-54

  Montaron, Bernard ^a  

^a SCHLUMBERGER   (France)

Author keywords

Crossing number; Intersection lemma

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

CROSSING NUMBER; INTERSECTION LEMMA;

GRAPH THEORY;

EID: 26444439064     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/jgt.20090     Document Type: Article

References (10)

1. M. Aigner and G. M. Ziegler, Raisonnements Divins, Springer-Verlag, France, 2002, pp. 237-239.
2. L. A. Székely, Crossing numbers and hard Erdós problems in discrete geometry, Combinatorics, Probability and Computing 6 (1997), 353-358.
3. J. Pach, J. Spencer, and G. Tóth, New bounds on crossing numbers, Discrete Comp Geom 24 (2000), 623-644.
4. J. Pach, R. Radoičić, G. Tardos, and G. Tóth, Improving the crossing lemma by finding more crossings in sparse graphs, Proceedings of the 19th Annual ACM Symposium on Computational Geometry, 2004.
5. R. B. Richter and C. Thomassen, Relations between crossing numbers of complete and complete bipartite graphs, Am Math Monthly, February (1997), 131-137.
6. J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Lecture Notes in Computer Science, Vol. 1190, Springer-Verlag, 1997, 345-354.
7. J. Spencer and G. Tóth, Crossing numbers of random graphs, Random Structures and Algorithms 21 (2002), 347-358.
8. J. Pach and G. Tóth, Which crossing number is it, anyway? JCT B 80 (2000), 225-246.
9. 5,n, J Combin Theory 9 (1970), 315-323.
10. G. Tóth, Communication to the author.