Intersection patterns of curves

Journal of the London Mathematical Society

Volumn 83, Issue 2, 2011, Pages 389-406

  Fox, Jacob ^a   Pach, János ^b,c   Tóth, Csaba D ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b EPFL   (Switzerland)

^c NEW YORK UNIVERSITY   (United States)

^d UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79952953750     PISSN: 00246107     EISSN: 14697750     Source Type: Journal    
DOI: 10.1112/jlms/jdq087     Document Type: Article

References (22)

1. M. AJTAI, V. CHVÁTAL, M. NEWBORN and E. SZEMERÉDI, 'Crossing-free subgraphs', Theory and practice of combinatorics, Mathematical Studies 60 (North-Holland, Amsterdam, 1982) 9-12.
2. N. ALON, J. PACH, R. PINCHASI, R. RADOIČIĆ and M. SHARIR, 'Crossing patterns of semi-algebraic sets', J. Combin. Theory Ser. A 111(2005) 310-326. (Pubitemid 41025193)
3. N. ALON, J. PACH and J. SOLYMOSI, 'Ramsey-type theorems with forbidden subgraphs', Combinatorica 21(2001) 155-170. (Pubitemid 33280807)
4. S. BASU, 'Combinatorial complexity in o-minimal geometry', Proc. London Math. Soc. 100(2010) 405-428.
5. M. CHUDNOVSKY and S. SAFRA, 'The Erdos-Hajnal conjecture for bull-free graphs', J. Combin. Theory Ser. B 98(2008) 1301-1310.
6. G. EHRLICH, S. EVEN and R. E. TARJAN, 'Intersection graphs of curves in the plane', J. Combin. Theory Ser. B 21(1976) 8-20.
7. P. ERDOŠ, 'Some remarks on the theory of graphs', Bull. Amer. Math. Soc. 53(1947) 292-294.
8. P. ERDOŠ and A. HAJNAL, 'Ramsey-type theorems', Discrete Appl. Math. 25(1989) 37-52.
9. P. ERDOŠ, A. HAJNAL and J. PACH, 'Ramsey-type theorem for bipartite graphs', Geombinatorics 10(2000) 64-68.
10. P. ERDOŠ and G. SZEKERES, 'A combinatorial problem in geometry', Compos. Math. 2(1935) 463-470.
11. J. FOX, 'A bipartite analogue of Dilworth's theorem', Order 23(2006) 197-209. (Pubitemid 44847301)
12. J. FOX and J. PACH, 'Separator theorems and Turan-type results for planar intersection graphs', Adv. Math. 219(2008) 1070-1080.
13. k-free intersection graphs of geometric objects in the plane', Proceedings of the 24th ACM Symposium on Computational Geometry (2008) 346-354.
14. J. FOX, J. PACH and CS. D. TÓTH, 'Turan-type results for partial orders and intersection graphs of convex sets', Israel J. Math. 178(2010) 29-50.
15. J. FOX, J. PACH and CS. D. TÓTH, 'A bipartite strengthening of the crossing lemma', J. Combin. Theory Ser. B 100(2010) 23-35.
16. M. C. GOLUMBIC, D. ROTEM and J. URRUTIA, 'Comparability graphs and intersection graphs', Discrete Math. 43(1983) 37-46.
17. T. LEIGHTON, 'New lower bound techniques for VLSI', Math. Syst. Theory 17(1984) 47-70.
18. R. J. LIPTON and R. E. TARJAN, 'A separator theorem for planar graphs', SIAM J. Appl. Math. 36(1979) 177-189.
19. B. MOHAR and C. THOMASSEN, Graphs on surfaces (Johns Hopkins University Press, Baltimore, 2001).
20. J. PACH and J. SOLYMOSI, 'Crossing patterns of segments', J. Combin. Theory Ser. A 96(2001) 316-325. (Pubitemid 33082408)
21. J. PACH and G. TÓTH, 'Comment of Fox news', Geombinatorics 15(2006) 150-154.
22. J. B. SIDNEY, S. J. SIDNEY and J. URRUTIA, 'Circle orders, n-gon orders and the crossing number', Order 5(1988) 1-10.