Extremal problems for geometric hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 105-114

  Dey, Tamal K ^a   Pach, János ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS);

CROSSING EDGES; EXTREMAL PROBLEMS; FORBIDDEN CONFIGURATIONS; GEOMETRIC GRAPHS; GEOMETRIC HYPERGRAPHS; GRAPH DRAWING ALGORITHMS; HIGHER DIMENSIONS; TOPOLOGICAL STRUCTURE;

GRAPH THEORY;

EID: 84990251882     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009486     Document Type: Conference Paper

References (26)

1. M. Ajtai, V. Chvátal, M. M. Newborn, and E. Szemerédi. Crossing-flee subgraphs. Ann. Discrete Math. 12 (1982), 9-12.
2. P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir. Quasi-planar graphs have a linear number of edges. In: Graph Drawing ‘95, Lecture Notes in Computer Science 1027, Springer-Verlag, Berlin, 1996, 1-7. Also in: Combinatorica (to appear).
3. J. Akiyama and N. Alon. Disjoint simplices and geometric hypergraphs. Combinatorial Mathematics (G. S. Bloom et al., eds.), Annals of the New York Academy of Sciences 555 (1989), 1-3.
4. B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger. Points and triangles in the plane and halving planes in space. Discrete and Computational Geometry 6 (1991), 435-442.
5. I. Bárány, Z. Fiiredi, and L. Lovász. On the number of halving planes. Combinatorica 10 (1990), 175-183.
6. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5 (1990), 99-160.
7. T. K. Dey. On counting triangulations in d dimensions. Computational geometry: Theory and Applications. 3 (1993), 315-325.
8. T. K. Dey and H. Edelsbrunnsr. Counting triangle crossings and halving planes. 9th Sympos. Comput. Geom. (1993), 270-273. Also: Discrete and Computational Geometry 12 (1994), 281-289.
9. P. Erdős. On extremal problems on graphs and generalized graphs. Israel J. Math. 2 (1964), 183-190.
10. G. Károlyi, J. Pach, and G. Tóth. Ramsey-type results for geometric graphs. 12th Sympos. Comput. Geom. (1996). Also in: Discrete and Computational Geometry (to appear).
11. Y. Kupitz. Extremal Problems in Combinatorial Geometry, Aarhus University Lecture Notes Series 53, Aarhus University, Denmark, 1979.
12. F.T. Leighton. Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, Mass., 1983.
13. R. Lipton and R. Tarjan. A separator theorem for planar graphs. SIAM J. Applied Mathematics 36 (1979), 177-189.
14. L. Lovász. On the number of halving lines. Annales Universitatis Scientarium Budapest, Eötvös, Sectio Mathematica 14 (1971), 107-108.
15. J. Pach. Notes on geometric graph theory. DIMACS Ser. Diser. Math. and Theoret. Comput. Sc. 6 (1991), 273-285.
16. J. Pach and P. K. Agarwal. Combinatorial Geometry, Wiley, New York, 1995.
17. J. Pach and M. Sharir. On the number of incidences between points and curves (to appear).
18. J. Pach, F. Shahrokhi, and M. Szegedy. Applications of crossing numbers, 10th ACM Sympos. Comput. Geom. (1994), 198-202.
19. J. Pach, W. Steiger, and M. Szemerédi. An upper bound on the number of planar k-sets. Discrete and Computational Geometry 7 (1992), 109-123.
20. J. Pach and J. Törőcsik. Some geometric applications of Dilworth’s theorem. 9th Sympos. Comput. Geom. (1993), 264-269. Also in: Discrete and Computational Geometry 12 (1994), 1-7.
21. L. A. Székely, Crossing numbers and hard Erdős problems in discrete geometry. Combinatorics, Probability, and Computing, (to appear).
22. E. Szemerédi and W. T. Trotter. Extremal problems in discrete geometry. Combinatorica 3 (1983), 381-392.
23. E. Szemerédi and W. T. Trotter. A combinatorial distinction between the Euclidean and projective planes. European J. Combinatorics 4 (1983), 385-394.
24. R. Tamassia and I. Tollis (eds.). Graph Drawing, Lecture Notes in Computer Science 894, Springer-Verlag, Berlin, 1995.
25. S. Vredica and R. Živaljević. New cases of the colored Tverberg’s theorem. In: Jerusalem Combinatorics ‘93, Contemp. Math. 178, Amer. Math. Soc., Providence, 1994, 325-334.
26. R. Živaljević and S. Vrećica. The colored Tverberg’s problem and complexes of injective functions. J. Combin. Theory Ser. A 61 (1992), 309-318.