Improving the crossing lemma by finding more crossings in sparse graphs


Published in:
Discrete and Computational Geometry, 36, 4, 527-552
Year:
2006
Note:
Professor Pach's number: [184]. Also in: 20th ACM Symposium on Computational Geometry, ACM Press, New York, 2004, 68-75.
Laboratories:




 Record created 2008-11-14, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)