Department of Computer Science, Eötvös University, Múzeum krt. 6-8, H-1088 Budapest, Hungary
Bibliografia
[1] J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős, Combinatorica 3 (1983), 281-297.
[2] K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete Comput. Geom. 5 (1990), 99-106.
[3] P. Erdős, On some of my favorite theorems, pages 97-132 of [6].
[4] P. Erdős, L. Alpár and G. Halász (eds.), Studies in Pure Mathematics, To the Memory of Paul Turán, Akadémiai Kiadó-Birkhäuser, Budapest-Basel, 1983.
[5] P. Erdős and E. Szemerédi, On sums and products of integers, pages 213-218 of [4].
[6] D. Miklós, V. T. Sós and T. Szőnyi (eds.), Combinatorics, Paul Erdős is Eighty, János Bolyai Math. Soc., Budapest, 1996.
[7] M. B. Nathanson, personal communication.
[8] L. A. Székely, Crossing numbers and hard Erdős problems in Discrete Geometry, Combin. Probab. Comput., 1997, to appear.
[9] E. Szemerédi and W. T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.bwnjournal-article-aav81i4p365bwm
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.